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.
The mobile agent rendezvous problem in the ring [electronic resource] / Evangelos Kranakis, Danny Krizanc, Euripides Markou
The mobile agent rendezvous problem in the ring [electronic resource] / Evangelos Kranakis, Danny Krizanc, Euripides Markou
Creatore [Kranakis, Evangelos]
Disciplina 006.3
Accesso persona Krizanc, Danny
Markou, Euripides
ISBN 9781608451371
9781608451364
Formato Risorse elettroniche
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto 1. Models for mobile agent computing -- Introduction -- What is a mobile agent -- Why mobile agents -- An algorithmic model for mobile agents -- Mobile agents -- Distributed networks -- Resource measures -- Mobile agent rendezvous -- Outline of the book -- Comments and bibliographic remarks --
2. Deterministic rendezvous in a ring -- Introduction -- A single stationary token -- The feasibility of rendezvous -- The time complexity of rendezvous -- Memory tradeoff for rendezvous with detection -- Limits to the memory trade-off -- Movable tokens -- Comments and bibliographic remarks --
3. Multiple agent rendezvous in a ring -- Introduction -- Impossibility of rendezvous -- Rendezvous with detection -- Conditional solutions -- Comments and bibliographic remarks --
4. Randomized rendezvous in a ring -- Introduction -- Random walk algorithm -- Randomization and tokens -- Time/memory trade-offs -- Coin half tour algorithm -- Approximate counting algorithm -- Comments and bibliographic remarks --
5. Other models -- Introduction -- Leader election and rendezvous -- Rendezvous with failing tokens -- Rendezvous when tokens fail upon release -- Rendezvous when tokens can fail at any time -- The cost of token failure -- Flickering tokens -- Asynchronous rendezvous -- Look-compute-move -- Model and terminology -- Impossibility results -- Gathering configurations with a single multiplicity -- Gathering rigid configurations -- Gathering an odd number of robots -- Dangerous networks -- Black-hole search in an asynchronous ring -- Rendezvous in asynchronous rings in spite of a black-hole -- Comments and bibliographic remarks --
6. Other topologies -- Introduction -- Synchronous torus -- Memory lower bounds for rendezvous -- Rendezvous algorithms -- Trees -- Arbitrary graphs -- Comments and bibliographic remarks --
Bibliography -- Glossary -- Authors' biographies -- Index.
Record Nr. UMICH-009489346
[Kranakis, Evangelos]  
Risorse elettroniche
Lo trovi qui: University of Michigan Ann Arbor
Fun with Algorithms [electronic resource] : 6th International Conference, FUN 2012, Venice, Italy, June 4-6, 2012. Proceedings / edited by Evangelos Kranakis, Danny Krizanc, Flaminia Luccio
Fun with Algorithms [electronic resource] : 6th International Conference, FUN 2012, Venice, Italy, June 4-6, 2012. Proceedings / edited by Evangelos Kranakis, Danny Krizanc, Flaminia Luccio
Creatore [Kranakis, Evangelos]
Accesso persona Krizanc, Danny
Luccio, Flaminia
Accesso ente SpringerLink (Online service)
ISBN 9783642303470
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UMICH-011662955
[Kranakis, Evangelos]  
Materiale a stampa
Lo trovi qui: University of Michigan Ann Arbor
The mobile agent rendezvous problem in the ring [electronic resource] / Evangelos Kranakis, Danny Krizanc, Euripides Markou
The mobile agent rendezvous problem in the ring [electronic resource] / Evangelos Kranakis, Danny Krizanc, Euripides Markou
Creatore [Kranakis, Evangelos]
Estensione 1 electronic text (xvi, 106 p.) : ill.
Disciplina 006.3
Accesso persona Krizanc, Danny
Markou, Euripides
ISBN 9781608451371 (electronic bk.)
1608451372 (ebook)
9781608451364 (pbk.)
1608451364 (pbk.)
Formato Risorse elettroniche
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto 1. Models for mobile agent computing -- Introduction -- What is a mobile agent -- Why mobile agents -- An algorithmic model for mobile agents -- Mobile agents -- Distributed networks -- Resource measures -- Mobile agent rendezvous -- Outline of the book -- Comments and bibliographic remarks --
2. Deterministic rendezvous in a ring -- Introduction -- A single stationary token -- The feasibility of rendezvous -- The time complexity of rendezvous -- Memory tradeoff for rendezvous with detection -- Limits to the memory trade-off -- Movable tokens -- Comments and bibliographic remarks --
3. Multiple agent rendezvous in a ring -- Introduction -- Impossibility of rendezvous -- Rendezvous with detection -- Conditional solutions -- Comments and bibliographic remarks --
4. Randomized rendezvous in a ring -- Introduction -- Random walk algorithm -- Randomization and tokens -- Time/memory trade-offs -- Coin half tour algorithm -- Approximate counting algorithm -- Comments and bibliographic remarks --
5. Other models -- Introduction -- Leader election and rendezvous -- Rendezvous with failing tokens -- Rendezvous when tokens fail upon release -- Rendezvous when tokens can fail at any time -- The cost of token failure -- Flickering tokens -- Asynchronous rendezvous -- Look-compute-move -- Model and terminology -- Impossibility results -- Gathering configurations with a single multiplicity -- Gathering rigid configurations -- Gathering an odd number of robots -- Dangerous networks -- Black-hole search in an asynchronous ring -- Rendezvous in asynchronous rings in spite of a black-hole -- Comments and bibliographic remarks --
6. Other topologies -- Introduction -- Synchronous torus -- Memory lower bounds for rendezvous -- Rendezvous algorithms -- Trees -- Arbitrary graphs -- Comments and bibliographic remarks --
Bibliography -- Glossary -- Authors' biographies -- Index.
Record Nr. STANFORD-a8823234
[Kranakis, Evangelos]  
Risorse elettroniche
Lo trovi qui: Stanford University
The mobile agent rendezvous problem in the ring [electronic resource] / Evangelos Kranakis, Danny Krizanc, Euripides Markou
The mobile agent rendezvous problem in the ring [electronic resource] / Evangelos Kranakis, Danny Krizanc, Euripides Markou
Creatore [Kranakis, Evangelos]
Estensione 1 electronic text (xvi, 106 p. : ill.) : digital file.
Disciplina 006.3
Accesso persona Krizanc, Danny
Markou, Euripides
ISBN 9781608451371 (electronic bk.)
9781608451364 (pbk.)
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto 1. Models for mobile agent computing -- Introduction -- What is a mobile agent -- Why mobile agents -- An algorithmic model for mobile agents -- Mobile agents -- Distributed networks -- Resource measures -- Mobile agent rendezvous -- Outline of the book -- Comments and bibliographic remarks --
2. Deterministic rendezvous in a ring -- Introduction -- A single stationary token -- The feasibility of rendezvous -- The time complexity of rendezvous -- Memory tradeoff for rendezvous with detection -- Limits to the memory trade-off -- Movable tokens -- Comments and bibliographic remarks --
3. Multiple agent rendezvous in a ring -- Introduction -- Impossibility of rendezvous -- Rendezvous with detection -- Conditional solutions -- Comments and bibliographic remarks --
4. Randomized rendezvous in a ring -- Introduction -- Random walk algorithm -- Randomization and tokens -- Time/memory trade-offs -- Coin half tour algorithm -- Approximate counting algorithm -- Comments and bibliographic remarks --
5. Other models -- Introduction -- Leader election and rendezvous -- Rendezvous with failing tokens -- Rendezvous when tokens fail upon release -- Rendezvous when tokens can fail at any time -- The cost of token failure -- Flickering tokens -- Asynchronous rendezvous -- Look-compute-move -- Model and terminology -- Impossibility results -- Gathering configurations with a single multiplicity -- Gathering rigid configurations -- Gathering an odd number of robots -- Dangerous networks -- Black-hole search in an asynchronous ring -- Rendezvous in asynchronous rings in spite of a black-hole -- Comments and bibliographic remarks --
6. Other topologies -- Introduction -- Synchronous torus -- Memory lower bounds for rendezvous -- Rendezvous algorithms -- Trees -- Arbitrary graphs -- Comments and bibliographic remarks --
Bibliography -- Glossary -- Authors' biographies -- Index.
Record Nr. NYU-004512158
[Kranakis, Evangelos]  
Materiale a stampa
Lo trovi qui: New York University
Fun with algorithms : 6th International Conference, FUN 2012, Venice, Italy, June 4-6, 2012, proceedings / Evangelos Kranakis, Danny Krizanc, Flaminia Luccio (eds.).
Fun with algorithms : 6th International Conference, FUN 2012, Venice, Italy, June 4-6, 2012, proceedings / Evangelos Kranakis, Danny Krizanc, Flaminia Luccio (eds.).
Creatore [FUN (Conference) (6th : 2012 : Venice, Italy)]
Estensione 1 online resource (xi, 394 p.)
Accesso ente Kranakis, Evangelos
Krizanc, Danny
Luccio, Flaminia, 1969-
Genere/Forma Electronic books
ISBN 9783642303463
3642303463
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Distributed Algorithms by Forgetful Mobile Robots / Paola Flocchini -- Stability and Metastability of the Logit Dynamics of Strategic Games / Giuseppe Persiano -- Art Galleries, k-modems, and k-convexity / Jorge Urrutia -- The Vulcan Game of Kal-Toh: Finding or Making Triconnected Planar Subgraphs / Terry Anderson and Therese Biedl -- Scandinavian Thins on Top of Cake: On the Smallest One-Size-Fits-All Box / Esther M. Arkin, Alon Efrat, George Hart, Irina Kostitsyna and Alexander Kröller, et al. -- The Kissing Problem: How to End a Gathering When Everyone Kisses Everyone Else Goodbye / Michael A. Bender, Ritwik Bose, Rezaul Chowdhury and Samuel McCauley -- Mad at Edge Crossings? Break the Edges! / Till Bruckdorfer and Michael Kaufmann -- Train Marshalling Is Fixed Parameter Tractable / Leo Brueggeman, Michael Fellows, Rudolf Fleischer, Martin Lackner and Christian Komusiewicz, et al. -- Conflict-Free Graph Orientations with Parity Constraints / Sarah Cannon, Mashhood Ishaque and Csaba D. Tóth -- The Multi-interval Ulam-Rényi Game / Ferdinando Cicalese -- Picture-Hanging Puzzles / Erik D. Demaine, Martin L. Demaine, Yair N. Minsky, Joseph S. B. Mitchell and Ronald L. Rivest, et al.
Optimal Sensor Networks for Area Monitoring Using Rotating and Beam Sensors / Stefan Dobrev, Lata Narayanan and Jaroslav Opatrny -- The Byzantine Brides Problem / Swan Dubois, Sébastien Tixeuil and Nini Zhu -- Lean Programs, Branch Mispredictions, and Sorting / Amr Elmasry and Jyrki Katajainen -- On Computer Integrated Rationalized Crossword Puzzle Manufacturing / Jakob Engel, Markus Holzer, Oliver Ruepp and Frank Sehnke -- Solving Single-Digit Sudoku Subproblems / David Eppstein -- Finding Good Coffee in Paris / Paola Flocchini, Matthew Kellett, Peter C. Mason and Nicola Santoro -- To Satisfy Impatient Web Surfers Is Hard / Fedor V. Fomin, Frédéric Giroire, Alain Jean-Marie, Dorian Mazauric and Nicolas Nisse -- Making Life Easier for Firefighters / Fedor V. Fomin, Pinar Heggernes and Erik Jan van Leeuwen -- Counting Perfect Matchings in Graphs of Degree 3 / Martin Fürer -- M.C. Escher Wrap Artist: Aesthetic Coloring of Ribbon Patterns / Ellen Gethner, David G. Kirkpatrick and Nicholas J. Pippenger -- On the Complexity of Rolling Block and Alice Mazes / Markus Holzer and Sebastian Jakobi -- Grid Graphs with Diagonal Edges and the Complexity of Xmas Mazes / Markus Holzer and Sebastian Jakobi.
Record Nr. DUKE-005759449
[FUN (Conference) (6th : 2012 : Venice, Italy)]  
Materiale a stampa
Lo trovi qui: Duke University
The mobile agent rendezvous problem in the ring [electronic resource] / Evangelos Kranakis, Danny Krizanc, Euripides Markou
The mobile agent rendezvous problem in the ring [electronic resource] / Evangelos Kranakis, Danny Krizanc, Euripides Markou
Creatore [Kranakis, Evangelos]
Estensione 1 online resource (xvi, 106 p. : ill.) : digital file.
Disciplina 006.3
Accesso persona Krizanc, Danny
Markou, Euripides
ISBN 9781608451371 (electronic bk.)
9781608451364 (pbk.)
Formato Risorse elettroniche
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto 1. Models for mobile agent computing -- Introduction -- What is a mobile agent -- Why mobile agents -- An algorithmic model for mobile agents -- Mobile agents -- Distributed networks -- Resource measures -- Mobile agent rendezvous -- Outline of the book -- Comments and bibliographic remarks --
2. Deterministic rendezvous in a ring -- Introduction -- A single stationary token -- The feasibility of rendezvous -- The time complexity of rendezvous -- Memory tradeoff for rendezvous with detection -- Limits to the memory trade-off -- Movable tokens -- Comments and bibliographic remarks --
3. Multiple agent rendezvous in a ring -- Introduction -- Impossibility of rendezvous -- Rendezvous with detection -- Conditional solutions -- Comments and bibliographic remarks --
4. Randomized rendezvous in a ring -- Introduction -- Random walk algorithm -- Randomization and tokens -- Time/memory trade-offs -- Coin half tour algorithm -- Approximate counting algorithm -- Comments and bibliographic remarks --
5. Other models -- Introduction -- Leader election and rendezvous -- Rendezvous with failing tokens -- Rendezvous when tokens fail upon release -- Rendezvous when tokens can fail at any time -- The cost of token failure -- Flickering tokens -- Asynchronous rendezvous -- Look-compute-move -- Model and terminology -- Impossibility results -- Gathering configurations with a single multiplicity -- Gathering rigid configurations -- Gathering an odd number of robots -- Dangerous networks -- Black-hole search in an asynchronous ring -- Rendezvous in asynchronous rings in spite of a black-hole -- Comments and bibliographic remarks --
6. Other topologies -- Introduction -- Synchronous torus -- Memory lower bounds for rendezvous -- Rendezvous algorithms -- Trees -- Arbitrary graphs -- Comments and bibliographic remarks --
Bibliography -- Glossary -- Authors' biographies -- Index.
Record Nr. UALBERTA-5419162
[Kranakis, Evangelos]  
Risorse elettroniche
Lo trovi qui: University of Alberta / NEOS Library Consortium
The mobile agent rendezvous problem in the ring [electronic resource] / Evangelos Kranakis, Danny Krizanc, Euripides Markou
The mobile agent rendezvous problem in the ring [electronic resource] / Evangelos Kranakis, Danny Krizanc, Euripides Markou
Creatore [Kranakis, Evangelos]
Estensione xvi, 106 p. : ill. (some col.), col. ports.
Accesso persona Krizanc, Danny
Markou, Euripides
Accesso ente ebrary, Inc.
Genere/Forma Electronic books
ISBN 9781608451364
9781608451371
Formato Risorse elettroniche
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UMICH-011588844
[Kranakis, Evangelos]  
Risorse elettroniche
Lo trovi qui: University of Michigan Ann Arbor