top

  Info

  • Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
Automatic sequences / by Friedrich von Haeseler
Automatic sequences / by Friedrich von Haeseler
Creatore [Haeseler, Friedrich von.]
Estensione 1 online resource (191 pages) : illustrations.
Disciplina 515/.24
Genere/Forma Electronic books
Soggetto non controllato Algorithms
Sequences (Mathematics)
ISBN 9783110197969
3110197960
9783110156294
3110156296
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto De Gruyter Expositions in Mathematics; Preface; Contents; Introduction; Chapter 1Preliminaries; Chapter 2Expanding endomorphisms and substitutions; Chapter 3Automaticity; Chapter 4Automaticity II; Bibliography; Index.
Record Nr. NYU-003200148
[Haeseler, Friedrich von.]  
Materiale a stampa
Lo trovi qui: New York University
Quantitative methods in supply chain management : models and algorithms / Ioannis T. Christou
Quantitative methods in supply chain management : models and algorithms / Ioannis T. Christou
Creatore [Christou, Ioannis T.]
Estensione 1 online resource (xiv, 397 pages) : illustrations (some color)
Disciplina 658.5
Genere/Forma Electronic books
Soggetto non controllato Engineering
Algorithms
Engineering economy
System safety
Engineering Economics, Organization, Logistics, Marketing
Production/Logistics/Supply Chain Management
Quality Control, Reliability, Safety and Risk
ISBN 9780857297662
085729766X
9780857297655
0857297651
1283350904
9781283350907
Classificazione 85.34
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto 1. A Review of Optimization Methods -- 2. Forecasting -- 3. Planning and Scheduling -- 4. Inventory Control -- 5. Location Theory and Distribution Management -- 6. Epilogue.
Record Nr. NYU-004371731
[Christou, Ioannis T.]  
Materiale a stampa
Lo trovi qui: New York University
Approximation and Online Algorithms : 9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised selected papers / Roberto Solis-Oba, Giuseppe Persiano (eds.).
Approximation and Online Algorithms : 9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised selected papers / Roberto Solis-Oba, Giuseppe Persiano (eds.).
Creatore [WAOA 2011 (2011 : Saarbrücken, Germany)]
Estensione 1 online resource (x, 273 pages).
Disciplina 005.1
Accesso persona Solis-Oba, Roberto
Persiano, Giuseppe
Genere/Forma Electronic books
Conference papers and proceedings
Soggetto non controllato Computer science
Computer software
Electronic data processing
Computational complexity
Algorithms
Algorithm Analysis and Problem Complexity
Discrete Mathematics in Computer Science
Numeric Computing
Information Systems Applications (incl. Internet)
ISBN 9783642291166
3642291163
3642291155
9783642291159
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Approximation Algorithms for Scheduling and Packing Problems / Klaus Jansen -- Approximating Subset k-Connectivity Problems / Zeev Nutov -- Learning in Stochastic Machine Scheduling / Sebastián Marbán, Cyriel Rutten and Tjark Vredeveld -- An Online Algorithm Optimally Self-tuning to Congestion for Power Management Problems / Wolfgang Bein, Naoki Hatta, Nelson Hernandez-Cons, Hiro Ito and Shoji Kasahara, et al. -- Single Approximation for Biobjective Max TSP / Cristina Bazgan, Laurent Gourvès, Jérôme Monnot and Fanny Pascual -- Parameterized Approximation Algorithms for Hitting Set / Ljiljana Brankovic and Henning Fernau -- Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs / Nadine Schwartges, Joachim Spoerhase and Alexander Wolff -- Optimization over Integers with Robustness in Cost and Few Constraints / Kai-Simon Goetzmann, Sebastian Stiller and Claudio Telha -- A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines without Preemption / Tomáš Ebenlendr and Jiří Sgall -- Scheduling Jobs on Identical and Uniform Processors Revisited / Klaus Jansen and Christina Robenek.
Approximation Algorithms for Fragmenting a Graph against a Stochastically-Located Threat / David B. Shmoys and Gwen Spencer -- Non-clairvoyant Weighted Flow Time Scheduling on Different Multi-processor Models / Jianqiao Zhu, Ho-Leung Chan and Tak-Wah Lam -- A New Perspective on List Update: Probabilistic Locality and Working Set / Reza Dorrigiv and Alejandro López-Ortiz -- OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm / Gerth Stølting Brodal, Gabriel Moruz and Andrei Negoescu -- Faster and Simpler Approximation of Stable Matchings / Katarzyna Paluch -- Simpler 3/4-Approximation Algorithms for MAX SAT / Anke van Zuylen -- On Online Algorithms with Advice for the k-Server Problem / Marc P. Renault and Adi Rosén -- Improved Lower Bound for Online Strip Packing / (Extended Abstract) / Rolf Harren and Walter Kern -- Competitive Router Scheduling with Structured Data / Yishay Mansour, Boaz Patt-Shamir and Dror Rawitz -- Approximation with a Fixed Number of Solutions of Some Biobjective Maximization Problems / Cristina Bazgan, Laurent Gourvès and Jérôme Monnot -- Generalized Maximum Flows over Time / Martin Groß and Martin Skutella -- The Price of Anarchy for Minsum Related Machine Scheduling / Ruben Hoeksma and Marc Uetz.
Record Nr. NYU-004622260
[WAOA 2011 (2011 : Saarbrücken, Germany)]  
Materiale a stampa
Lo trovi qui: New York University
Experimental algorithms : 11th International Symposium, SEA 2012, Bordeaux, France, June 7-9, 2012. Proceedings / Ralf Klasing (eds.).
Experimental algorithms : 11th International Symposium, SEA 2012, Bordeaux, France, June 7-9, 2012. Proceedings / Ralf Klasing (eds.).
Creatore [SEA (Symposium) (11th : 2012 : Bordeaux, France)]
Estensione 1 online resource.
Disciplina 005.1
Accesso persona Klasing, Ralf
Genere/Forma Electronic books
Conference papers and proceedings
Soggetto non controllato Computer science
Computer Communication Networks
Computer software
Artificial intelligence
Algorithms
Algorithm Analysis and Problem Complexity
Information Systems Applications (incl. Internet)
ISBN 9783642308505
3642308503
9783642308499
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Automatic Decomposition and Branch-and-Price-A Status Report / Marco E. Lübbecke -- Continuous Local Strategies for Robotic Formation Problems / Barbara Kempkes and Friedhelm Meyer auf der Heide -- Engineering Graph Partitioning Algorithms / Vitaly Osipov, Peter Sanders and Christian Schulz -- Space Efficient Modifications to Structator- A Fast Index-Based Search Tool for RNA Sequence-Structure Patterns / Benjamin Albrecht and Volker Heun -- Implementation and Comparison of Heuristics for the Vertex Cover Problem on Huge Graphs / Eric Angel, Romain Campigotto and Christian Laforest -- How to Attack the NP-Complete Dag Realization Problem in Practice / Annabell Berger and Matthias Müller-Hannemann -- New Results about Multi-band Uncertainty in Robust Optimization / Christina Büsing and Fabio D'Andreagiovanni -- Compact Relaxations for Polynomial Programming Problems / Sonia Cafieri, Pierre Hansen, Lucas Létocart, Leo Liberti and Frédéric Messine -- Relaxations of Multilinear Convex Envelopes: Dual Is Better Than Primal / Alberto Costa and Leo Liberti -- On Computing the Diameter of Real-World Directed (Weighted) Graphs / Pierluigi Crescenzi, Roberto Grossi, Leonardo Lanzi and Andrea Marino -- Reoptimizing the Strengthened Metric TSP on Multiple Edge Weight Modifications / Annalisa D'Andrea and Guido Proietti.
Engineering a New Loop-Free Shortest Paths Routing Algorithm / Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni and Vinicio Maurizio -- Fully Dynamic Maintenance of Arc-Flags in Road Networks / Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni and Camillo Vitale -- A More Reliable Greedy Heuristic for Maximum Matchings in Sparse Random Graphs / Martin Dietzfelbinger, Hendrik Peilke and Michael Rink -- Branch Mispredictions Don't Affect Mergesort / Amr Elmasry, Jyrki Katajainen and Max Stenmark -- A Multiple Sliding Windows Approach to Speed Up String Matching Algorithms / Simone Faro and Thierry Lecroq -- Algorithms for Subnetwork Mining in Heterogeneous Networks / Guillaume Fertin, Hafedh Mohamed Babou and Irena Rusu -- Computing Strong Articulation Points and Strong Bridges in Large Scale Graphs / Donatella Firmani, Giuseppe F. Italiano, Luigi Laura, Alessio Orlandi and Federico Santaroni -- Adaptive Distributed b-Matching in Overlays with Preferences / Giorgos Georgiadis and Marina Papatriantafilou -- Dynamizing Succinct Tree Representations / Stelios Joannou and Rajeev Raman -- A Label Correcting Algorithm for the Shortest Path Problem on a Multi-modal Route Network / Dominik Kirchler, Leo Liberti and Roberto Wolfler Calvo -- Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data / Masashi Kiyomi, Yoshio Okamoto and Toshiki Saitoh.
Candidate Sets for Alternative Routes in Road Networks / Dennis Luxen and Dennis Schieferdecker -- Paired and Altruistic Kidney Donation in the UK: Algorithms and Experimentation / David F. Manlove and Gregg O'Malley -- An Evaluation of Community Detection Algorithms on Large-Scale Email Traffic / Farnaz Moradi, Tomas Olovsson and Philippas Tsigas -- Fast, Small, Simple Rank/Select on Bitmaps / Gonzalo Navarro and Eliana Providel -- Space-Efficient Top-k Document Retrieval / Gonzalo Navarro and Daniel Valenzuela -- Engineering Efficient Paging Algorithms / Gabriel Moruz, Andrei Negoescu, Christian Neumann and Volker Weichert -- Feasibility Pump Heuristics for Column Generation Approaches / Pierre Pesneau, Ruslan Sadykov and François Vanderbeck -- Exact Graph Search Algorithms for Generalized Traveling Salesman Path Problems / Michael N. Rice and Vassilis J. Tsotras -- Control Complexity in Bucklin, Fallback, and Plurality Voting: An Experimental Approach / Jörg Rothe and Lena Schend -- Advanced Coarsening Schemes for Graph Partitioning / Ilya Safro, Peter Sanders and Christian Schulz -- A Heuristic for Non-convex Variance-Based Clustering Criteria / Rodrigo F. Toso, Casimir A. Kulikowski and Ilya B. Muchnik -- A Decomposition Approach for Solving Critical Clique Detection Problems / Jose L. Walteros and Panos M. Pardalos.
Record Nr. NYU-004623038
[SEA (Symposium) (11th : 2012 : Bordeaux, France)]  
Materiale a stampa
Lo trovi qui: New York University
Approximation and Online Algorithms : 9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised selected papers / Roberto Solis-Oba, Giuseppe Persiano (eds.).
Approximation and Online Algorithms : 9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised selected papers / Roberto Solis-Oba, Giuseppe Persiano (eds.).
Creatore [WAOA 2011 (2011 : Saarbrücken, Germany)]
Estensione 1 online resource (x, 273 pages).
Disciplina 005.1
Accesso persona Solis-Oba, Roberto
Persiano, Giuseppe
Genere/Forma Electronic books
Conference papers and proceedings
Soggetto non controllato Computer science
Computer software
Electronic data processing
Computational complexity
Algorithms
Algorithm Analysis and Problem Complexity
Discrete Mathematics in Computer Science
Numeric Computing
Information Systems Applications (incl. Internet)
ISBN 9783642291166
3642291163
9783642291159
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Approximation Algorithms for Scheduling and Packing Problems / Klaus Jansen -- Approximating Subset k-Connectivity Problems / Zeev Nutov -- Learning in Stochastic Machine Scheduling / Sebastián Marbán, Cyriel Rutten and Tjark Vredeveld -- An Online Algorithm Optimally Self-tuning to Congestion for Power Management Problems / Wolfgang Bein, Naoki Hatta, Nelson Hernandez-Cons, Hiro Ito and Shoji Kasahara, et al. -- Single Approximation for Biobjective Max TSP / Cristina Bazgan, Laurent Gourvès, Jérôme Monnot and Fanny Pascual -- Parameterized Approximation Algorithms for Hitting Set / Ljiljana Brankovic and Henning Fernau -- Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs / Nadine Schwartges, Joachim Spoerhase and Alexander Wolff -- Optimization over Integers with Robustness in Cost and Few Constraints / Kai-Simon Goetzmann, Sebastian Stiller and Claudio Telha -- A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines without Preemption / Tomáš Ebenlendr and Jiří Sgall -- Scheduling Jobs on Identical and Uniform Processors Revisited / Klaus Jansen and Christina Robenek.
Approximation Algorithms for Fragmenting a Graph against a Stochastically-Located Threat / David B. Shmoys and Gwen Spencer -- Non-clairvoyant Weighted Flow Time Scheduling on Different Multi-processor Models / Jianqiao Zhu, Ho-Leung Chan and Tak-Wah Lam -- A New Perspective on List Update: Probabilistic Locality and Working Set / Reza Dorrigiv and Alejandro López-Ortiz -- OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm / Gerth Stølting Brodal, Gabriel Moruz and Andrei Negoescu -- Faster and Simpler Approximation of Stable Matchings / Katarzyna Paluch -- Simpler 3/4-Approximation Algorithms for MAX SAT / Anke van Zuylen -- On Online Algorithms with Advice for the k-Server Problem / Marc P. Renault and Adi Rosén -- Improved Lower Bound for Online Strip Packing / (Extended Abstract) / Rolf Harren and Walter Kern -- Competitive Router Scheduling with Structured Data / Yishay Mansour, Boaz Patt-Shamir and Dror Rawitz -- Approximation with a Fixed Number of Solutions of Some Biobjective Maximization Problems / Cristina Bazgan, Laurent Gourvès and Jérôme Monnot -- Generalized Maximum Flows over Time / Martin Groß and Martin Skutella -- The Price of Anarchy for Minsum Related Machine Scheduling / Ruben Hoeksma and Marc Uetz.
Record Nr. NYU-004374775
[WAOA 2011 (2011 : Saarbrücken, Germany)]  
Materiale a stampa
Lo trovi qui: New York University
Assignment problems [electronic resource] / Rainer Burkard, Mauro Dell'Amico, Silvano Martello
Assignment problems [electronic resource] / Rainer Burkard, Mauro Dell'Amico, Silvano Martello
Creatore [Burkard, Rainer E.]
Edizione [Rev. reprint.]
Estensione 1 electronic text (xxii, 393 p.) : ill., digital file.
Disciplina 519.7/2
Accesso persona Dell'Amico, Mauro
Martello, Silvano
Accesso ente Society for Industrial and Applied Mathematics
Soggetto non controllato Combinatorial optimization
Linear assignment
Quadratic assignment
Matching
Algorithms
ISBN 9781611972238 (electronic bk.)
9781611972221
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Introduction -- Theoretical foundations -- Bipartite matching algorithms -- Linear sum assignment problem -- Further results on the linear sum assignment problem -- Other types of linear assignment problems -- Quadratic assignment problems: formulations and bounds -- Quadratic assignment problems: algorithms -- Other types of quadratic assignment problems -- Multi-index assignment problems.
Record Nr. NYU-006557015
[Burkard, Rainer E.]  
Materiale a stampa
Lo trovi qui: New York University
Numerical Integration [electronic resource] : on Advanced Computer Systems / by Arnold R. Krommer, Christoph W. Ueberhuber
Numerical Integration [electronic resource] : on Advanced Computer Systems / by Arnold R. Krommer, Christoph W. Ueberhuber
Creatore [Krommer, Arnold R.]
Accesso persona Ueberhuber, Christoph W.
Accesso ente SpringerLink (Online service)
Soggetto non controllato Mathematics
Algorithms
Numerical Analysis
ISBN 9783540584100
Formato Software
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UCHICAGO-7355261
[Krommer, Arnold R.]  
Software
Lo trovi qui: University of Chicago
Artificial Intelligence and Symbolic Mathematical Computation [electronic resource] : International Conference, AISMC-3, Steyr, Austria, September, 23 - 25, 1996. Proceedings / by Jaques Calmet, John A. Campbell, Jochen Pfalzgraf
Artificial Intelligence and Symbolic Mathematical Computation [electronic resource] : International Conference, AISMC-3, Steyr, Austria, September, 23 - 25, 1996. Proceedings / by Jaques Calmet, John A. Campbell, Jochen Pfalzgraf
Creatore [Calmet, Jaques]
Accesso persona Campbell, John A.
Pfalzgraf, Jochen
Accesso ente SpringerLink (Online service)
Soggetto non controllato Computer Science
Algorithms
Artificial Intelligence (incl. Robotics)
Mathematical Logic and Formal Languages
Symbolic and Algebraic Manipulation
Systems and Information Theory in Engineering
ISBN 9783540617327
Formato Software
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UCHICAGO-7355546
[Calmet, Jaques]  
Software
Lo trovi qui: University of Chicago
Artificial Intelligence and Symbolic Computation [electronic resource] : International Conference AISC'98, Plattsburgh, New York, USA, September 16-18, 1998, Proceedings / by Jacques Calmet, Jan Plaza
Artificial Intelligence and Symbolic Computation [electronic resource] : International Conference AISC'98, Plattsburgh, New York, USA, September 16-18, 1998, Proceedings / by Jacques Calmet, Jan Plaza
Creatore [Calmet, Jacques]
Accesso persona Plaza, Jan.
Accesso ente SpringerLink (Online service)
Soggetto non controllato Computer Science
Algorithms
Artificial Intelligence (incl. Robotics)
Mathematical Logic and Formal Languages
Symbolic and Algebraic Manipulation
ISBN 9783540649601
Formato Software
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UCHICAGO-7355868
[Calmet, Jacques]  
Software
Lo trovi qui: University of Chicago
Algorithmic Number Theory [electronic resource] : 6th International Symposium, ANTS-VI, Burlington, VT, USA, June 13-18, 2004, Proceedings / by Duncan Buell
Algorithmic Number Theory [electronic resource] : 6th International Symposium, ANTS-VI, Burlington, VT, USA, June 13-18, 2004, Proceedings / by Duncan Buell
Creatore [Buell, Duncan]
Accesso ente SpringerLink (Online service)
Soggetto non controllato Computer Science
Algorithm Analysis and Problem Complexity
Algorithms
Data Encryption
Discrete Mathematics in Computer Science
Number Theory
Symbolic and Algebraic Manipulation
ISBN 9783540221562
Formato Software
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UCHICAGO-7354345
[Buell, Duncan]  
Software
Lo trovi qui: University of Chicago