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.
Structural information and communication complexity : 19th International Colloquium, SIROCCO 2012, Reykjavik, Iceland, June 30-July 2, 2012, Proceedings / Guy Even, Magnús M. Halldórsson (eds.).
Structural information and communication complexity : 19th International Colloquium, SIROCCO 2012, Reykjavik, Iceland, June 30-July 2, 2012, Proceedings / Guy Even, Magnús M. Halldórsson (eds.).
Creatore [Colloquium on Structural Information and Communication Complexity (19th : 2012 : Reykjavík, Iceland)]
Estensione 1 online resource (xix, 340 pages) : illustrations.
Accesso persona Even, Guy.
Magnús M. Halldórsson
Genere/Forma Electronic books
Conference papers and proceedings
Soggetto non controllato Computer science
Computer Communication Networks
Data structures (Computer science)
Computer software
Computational complexity
Algorithms
Algorithm Analysis and Problem Complexity
Discrete Mathematics in Computer Science
ISBN 9783642311048
3642311040
3642311032
9783642311031
Classificazione 54.10
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Space Lower Bounds for Low-Stretch Greedy Embeddings / Ioannis Caragiannis and Christos Kalaitzis -- The Fault Tolerant Capacitated k-Center Problem / Shiri Chechik and David Peleg -- Notions of Connectivity in Overlay Networks / Yuval Emek, Pierre Fraigniaud, Amos Korman, Shay Kutten and David Peleg -- Changing of the Guards: Strip Cover with Duty Cycling / Amotz Bar-Noy, Ben Baumer and Dror Rawitz -- Deterministic Local Algorithms, Unique Identifiers, and Fractional Graph Colouring / Henning Hasemann, Juho Hirvonen, Joel Rybicki and Jukka Suomela -- An Algorithm for Online Facility Leasing / Peter Kling, Friedhelm Meyer auf der Heide and Peter Pietrzyk -- Agreement in Directed Dynamic Networks / Martin Biely, Peter Robinson and Ulrich Schmid -- Bounding Interference in Wireless Ad Hoc Networks with Nodes in Random Position / Majid Khabbazian, Stephane Durocher and Alireza Haghnegahdar -- Strong Connectivity of Sensor Networks with Double Antennae / Mohsen Eftekhari Hesari, Evangelos Kranakis, Fraser MacQuarie, Oscar Morales-Ponce and Lata Narayanan -- Distributed Multiple-Message Broadcast in Wireless Ad-Hoc Networks under the SINR Model / Dongxiao Yu, Qiang-Sheng Hua, Yuexuan Wang, Haisheng Tan and Francis C.M. Lau -- Wireless Network Stability in the SINR Model / Eyjólfur Ingi Ásgeirsson, Magnús M. Halldórsson and Pradipta Mitra -- What Can Be Computed without Communications? / Heger Arfaoui and Pierre Fraigniaud -- On Bidimensional Congestion Games / Vittorio Bilò, Michele Flammini and Vasco Gallotti -- Mobile Network Creation Games / Michele Flammini, Vasco Gallotti, Giovanna Melideo, Gianpiero Monaco and Luca Moscardelli -- Homonyms with Forgeable Identifiers / Carole Delporte-Gallet, Hugues Fauconnier and Hung Tran-The -- Asynchrony and Collusion in the N-party BAR Transfer Problem / Xavier Vilaça, Oksana Denysyuk and Luís Rodrigues -- Early Deciding Synchronous Renaming in O(logf) Rounds or Less / Dan Alistarh, Hagit Attiya, Rachid Guerraoui and Corentin Travers -- On Snapshots and Stable Properties Detection in Anonymous Fully Distributed Systems (Extended Abstract) / Jérémie Chalopin, Yves Métivier and Thomas Morsellino -- Self-stabilizing (k, r)-Clustering in Clock Rate-Limited Systems / Andreas Larsson and Philippas Tsigas -- Increasing the Power of the Iterated Immediate Snapshot Model with Failure Detectors / Michel Raynal and Julien Stainer -- Improved Approximation for Orienting Mixed Graphs / Iftah Gamzu and Moti Medina -- Analysis of Random Walks Using Tabu Lists / Karine Altisen, Stéphane Devismes, Antoine Gerbaud and Pascal Lafourcade -- Online Graph Exploration with Advice / Stefan Dobrev, Rastislav Královič and Euripides Markou -- Asynchronous Exploration of an Unknown Anonymous Dangerous Graph with O(1) Pebbles / Balasingham Balamohan, Stefan Dobrev, Paola Flocchini and Nicola Santoro -- Time of Anonymous Rendezvous in Trees: Determinism vs. Randomization / Samir Elouasbi and Andrzej Pelc -- Randomized Rendezvous of Mobile Agents in Anonymous Unidirectional Ring Networks / Shinji Kawai, Fukuhito Ooshita, Hirotsugu Kakugawa and Toshimitsu Masuzawa -- Getting Close without Touching / Linda Pagli, Giuseppe Prencipe and Giovanni Viglietta -- Gathering of Robots on Anonymous Grids without Multiplicity Detection / Gianlorenzo D'Angelo, Gabriele Di Stefano, Ralf Klasing and Alfredo Navarra.
Record Nr. UCHICAGO-11077025
[Colloquium on Structural Information and Communication Complexity (19th : 2012 : Reykjavík, Iceland)]  
Materiale a stampa
Lo trovi qui: University of Chicago
Parameterized and exact computation : 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised selected papers / edited by Dániel Marx, Peter Rossmanith
Parameterized and exact computation : 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised selected papers / edited by Dániel Marx, Peter Rossmanith
Creatore [IPEC (Symposium) (6th : 2011 : Saarbrücken, Germany)]
Estensione 1 online resource (viii, 271 pages).
Accesso persona Marx, Dániel
Rossmanith, Peter
Genere/Forma Electronic books
Conference papers and proceedings
Soggetto non controllato Computer science
Information theory
Computer software
Computational complexity
Algebra -- Data processing
Algorithms
Algorithm Analysis and Problem Complexity
Discrete Mathematics in Computer Science
Theory of Computation
Symbolic and Algebraic Manipulation
Computation by Abstract Devices
ISBN 9783642280504
3642280501
9783642280498
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto On Multiway Cut Parameterized above Lower Bounds / Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk and Jakub Onufry Wojtaszczyk -- Parameterized Complexity of Firefighting Revisited / Marek Cygan, Fedor V. Fomin and Erik Jan van Leeuwen -- Parameterized Complexity in Multiple-Interval Graphs: Domination / Minghui Jiang and Yong Zhang -- A Faster Algorithm for Dominating Set Analyzed by the Potential Method / Yoichi Iwata -- Contracting Graphs to Paths and Trees / Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov and Christophe Paul -- Increasing the Minimum Degree of a Graph by Contractions / Petr A. Golovach, Marcin Kamiński, Daniël Paulusma and Dimitrios M. Thilikos -- Planar Disjoint-Paths Completion / Isolde Adler, Stavros G. Kolliopoulos and Dimitrios M. Thilikos -- Sparse Solutions of Sparse Linear Systems: Fixed-Parameter Tractability and an Application of Complex Group Testing / Peter Damaschke -- New Upper Bounds for MAX-2-SAT and MAX-2-CSP w.r.t. the Average Variable Degree / Alexander Golovnev -- Improved Parameterized Algorithms for above Average Constraint Satisfaction / Eun Jung Kim and Ryan Williams -- On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal / Bart M.P. Jansen and Stefan Kratsch -- Kernel Bounds for Path and Cycle Problems / Hans L. Bodlaender, Bart M.P. Jansen and Stefan Kratsch -- On the Hardness of Losing Width / Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk and Saket Saurabh -- Safe Approximation and Its Relation to Kernelization / Jiong Guo, Iyad Kanj and Stefan Kratsch -- Simpler Linear-Time Kernelization for Planar Dominating Set / Torben Hagerup -- Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs / René van Bevern, Sepp Hartung, Frank Kammer, Rolf Niedermeier and Mathias Weller -- Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width / Hajo Broersma, Petr A. Golovach and Viresh Patel -- Finding Good Decompositions for Dynamic Programming on Dense Graphs / Eivind Magnus Hvidevold, Sadia Sharmin, Jan Arne Telle and Martin Vatshelle -- Parameterized Maximum Path Coloring / Michael Lampis -- On Cutwidth Parameterized by Vertex Cover / Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk and Saket Saurabh -- Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics / Robert Ganian.
Record Nr. UCHICAGO-11076741
[IPEC (Symposium) (6th : 2011 : Saarbrücken, Germany)]  
Materiale a stampa
Lo trovi qui: University of Chicago
Graph-theoretic concepts in computer science [electronic resource] : 37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, June 21-24, 2011 : revised papers / Petr Kolman, Jan Kratochvíl (eds.).
Graph-theoretic concepts in computer science [electronic resource] : 37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, June 21-24, 2011 : revised papers / Petr Kolman, Jan Kratochvíl (eds.).
Creatore [International Workshop WG (37th : 2011 : Teplá, Czech Republic)]
Estensione 1 online resource (xi, 344 p.) : ill. (some col.
Disciplina 511/.5
Accesso persona Kolman, Petr
Kratochvíl, Jan.
Genere/Forma Electronic books
Soggetto non controllato Computer science
Computer Communication Networks
Data structures (Computer science)
Computer software
Computational complexity
Algorithms
Geometry
Discrete Mathematics in Computer Science
Algorithm Analysis and Problem Complexity
Data Structures
ISBN 9783642258701 (electronic bk.)
3642258700 (electronic bk.)
9783642258695
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UPENN-9960090133503681
[International Workshop WG (37th : 2011 : Teplá, Czech Republic)]  
Materiale a stampa
Lo trovi qui: University of Pennsylvania
Isomorphic routing on a toroidal mesh
Isomorphic routing on a toroidal mesh
Creatore [Institute for Computer Applications in Science and Engineering.93-5.]
Accesso persona Mao, W.
Nicol, D. M.
Soggetto non controllato Message routing
Network
Scheduling
Complexity
Algorithms
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. STANFORD-a4633008
[Institute for Computer Applications in Science and Engineering.93-5.]  
Materiale a stampa
Lo trovi qui: Stanford University
QMRCGSTAB: a quasi-minimal residual variant of the Bi-CGSTAB algorithm for nonsymmetric systems
QMRCGSTAB: a quasi-minimal residual variant of the Bi-CGSTAB algorithm for nonsymmetric systems
Creatore [University of Illinois at Urbana-Champaign.Center for Supercomputing Research and Development.1231.]
Accesso persona Chan, T. F.
Gallopoulos, E.
Simoncini, V.
Szeto, T.
Tong, C. H.
Soggetto non controllato Algorithms
Nonsymmetric linear systems
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. STANFORD-a4631270
[University of Illinois at Urbana-Champaign.Center for Supercomputing Research and Development.1231.]  
Materiale a stampa
Lo trovi qui: Stanford University
Geometry coding and VRML
Geometry coding and VRML
Creatore [Thomas J. Watson IBM Research CenterRC20925]
Accesso persona Taubin, Gabriel
Horn, William P.
Rossignac, Jarek
Lazarus, Francis
Soggetto non controllato Computer graphics
Computational geometry and object modeling
Curve
Surface
Solid
Object representations
Compression
Algorithms
Graphics
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. STANFORD-a4643133
[Thomas J. Watson IBM Research CenterRC20925]  
Materiale a stampa
Lo trovi qui: Stanford University
The transformation calculus
The transformation calculus
Creatore [Tōkyō Daigaku.Department of Information Science.94-09.]
Accesso persona Garrigue, Jacques
Soggetto non controllato Lambda-calculus
Algorithms
Functional programming
Imperative programming
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. STANFORD-a4638703
[Tōkyō Daigaku.Department of Information Science.94-09.]  
Materiale a stampa
Lo trovi qui: Stanford University
Differential evolution and large-scale optimization applications / Aleš Zamuda
Differential evolution and large-scale optimization applications / Aleš Zamuda
Creatore [Zamuda, Aleš., speaker]
Estensione 1 streaming video (141 minutes) : sound, colour.
Disciplina 006.3
Accesso ente IGI Global, production company
Genere/Forma Educational films
Streaming videos
Soggetto non controllato Algorithms
Optimization
Parallel Differential Evolution
Performance Improvement
Stochastic Methods
Tree Model Reconstruction
ISBN 9781522507291
1522507299
9781522507307
Formato Videoregistrazioni
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Section 1. Differential evolution -- Lesson 1. Explaining differential evolution -- Lesson 2. Improvements to differential evolution -- Lesson 3. Benchmarks of differential evolution --
Section 2. Application of DE to tree model reconstruction -- Lesson 4. Procedural tree models in tree model reconstruction -- Lesson 5. Automatic modeling of trees using differential evolution -- Lesson 6. Reconstructing trees from images using differential evolution --
Section 3. Application of differential evolution in underwater glider path planning -- Lesson 7. Solving underwater robotics challenges with differential evolution -- Lesson 8. Planning glider paths using differential evolution -- Lesson 9. Differential evolution performance comparison --
Section 4. Application of differential evolution in hydro and thermal power plant scheduling -- Lesson 10. Hydro-thermal scheduling using differential evolution -- Lesson 11. Parallel differential evolution -- Lesson 12. Surrogate differential evolution --
Section 5. Applications of differential evolution in real world industrial challenges -- Lesson 13. CEC 2011 benchmarks of differential evolution -- Lesson 14. Open issues of differential evolution -- Lesson 15. Forthcoming challenges of differential evolution.
Record Nr. STANFORD-a11701466
[Zamuda, Aleš., speaker]  
Videoregistrazioni
Lo trovi qui: Stanford University
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques [electronic resource] : 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004 and 8th International Workshop on / by Klaus Jansen, Sanjeev Khanna, José D. P. Rolim
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques [electronic resource] : 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004 and 8th International Workshop on / by Klaus Jansen, Sanjeev Khanna, José D. P. Rolim
Creatore [Jansen, Klaus]
Accesso persona Khanna, Sanjeev
Rolim, José D. P.
Ron, Dana
Accesso ente SpringerLink (Online service)
Soggetto non controllato Computer Science
Algorithm Analysis and Problem Complexity
Algorithms
Discrete Mathematics in Computer Science
Numeric Computing
ISBN 9783540228943
Formato Software
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UCHICAGO-7354431
[Jansen, Klaus]  
Software
Lo trovi qui: University of Chicago
Entwurf und Analyse von Algorithmen [electronic resource] / von Markus Nebel
Entwurf und Analyse von Algorithmen [electronic resource] / von Markus Nebel
Creatore [Nebel, Markus]
Estensione 1 online resource.
Disciplina 005.73
Accesso ente SpringerLink (Online service)
Soggetto non controllato Data Structures
Algorithms
Computer Science, general
Computer Science
ISBN 9783834823397
Formato Risorse elettroniche
Livello bibliografico Monografia
Lingua di pubblicazione ger
Record Nr. UCHICAGO-8910375
[Nebel, Markus]  
Risorse elettroniche
Lo trovi qui: University of Chicago