Search

Your search keyword '"Flocchini, Paola"' showing total 781 results
Start Over Author "Flocchini, Paola"

Refine your results

more »

more »

more »

more »
781 results on '"Flocchini, Paola"'

103. Cleaning an Arbitrary Regular Network with Mobile Agents

Author

Flocchini, Paola, Nayak, Amiya, Schulz, Arno, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Dough, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, and Chakraborty, Goutam, editor

Published
2005
Full Text
View/download PDF

104. Distributed Exploration of an Unknown Graph

Author

Das, Shantanu, Flocchini, Paola, Nayak, Amiya, Santoro, Nicola, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Pelc, Andrzej, editor, and Raynal, Michel, editor

Published
2005
Full Text
View/download PDF

105. Hybrid-Chord: A Peer-to-Peer System Based on Chord

Author

Flocchini, Paola, Nayak, Amiya, Xie, Ming, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Ghosh, R. K., editor, and Mohanty, Hrushikesha, editor

Published
2005
Full Text
View/download PDF

107. Multiple Agents RendezVous in a Ring in Spite of a Black Hole

Author

Dobrev, Stefan, Flocchini, Paola, Prencipe, Giuseppe, Santoro, Nicola, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Papatriantafilou, Marina, editor, and Hunel, Philippe, editor

Published
2004
Full Text
View/download PDF

108. Mobile Agents Rendezvous When Tokens Fail

Author

Flocchini, Paola, Kranakis, Evangelos, Krizanc, Danny, Luccio, Flaminia L., Santoro, Nicola, Sawchuk, Cindy, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Královic̆, Ratislav, editor, and Sýkora, Ondrej, editor

Published
2004
Full Text
View/download PDF

109. Improved Bounds for Optimal Black Hole Search with a Network Map

Author

Dobrev, Stefan, Flocchini, Paola, Santoro, Nicola, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Královic̆, Ratislav, editor, and Sýkora, Ondrej, editor

Published
2004
Full Text
View/download PDF

110. Multiple Mobile Agent Rendezvous in a Ring

Author

Flocchini, Paola, Kranakis, Evangelos, Krizanc, Danny, Santoro, Nicola, Sawchuk, Cindy, Goos, Gerhard, editor, Hartmanis, Juris, editor, van Leeuwen, Jan, editor, and Farach-Colton, Martín, editor

Published
2004
Full Text
View/download PDF

113. Solving the Robots Gathering Problem

Author

Cieliebak, Mark, Flocchini, Paola, Prencipe, Giuseppe, Santoro, Nicola, Goos, G., editor, Hartmanis, J., editor, van Leeuwen, J., editor, Baeten, Jos C. M., editor, Lenstra, Jan Karel, editor, Parrow, Joachim, editor, and Woeginger, Gerhard J., editor

Published
2003
Full Text
View/download PDF

116. Hybrid control in multi-robot systems and distributed computing

Author

Dorigo, Marco, Flocchini, Paola, Santoro, Nicola, Spinello, Davide, Shi, Wei, Nayak, Amiya, Natalizio, Enrico, Heinrich, Mary Katherine, Jamshidpey, Aryo, Dorigo, Marco, Flocchini, Paola, Santoro, Nicola, Spinello, Davide, Shi, Wei, Nayak, Amiya, Natalizio, Enrico, Heinrich, Mary Katherine, and Jamshidpey, Aryo

Abstract

Multi-agent systems (MAS) have been of interest to many researchers during the last decades. This thesis focuses on multi-robot systems (MRS) and programmable matter as two types of MAS. Regarding MRS, the focus is on the ’mergeable nervous systems’ (MNS) concept which allows the robots to connect to one another and establish a communication network through self-organization and then use the network to temporarily report sensing events and cede authority to a single robot in the system. Here, in a collective perception scenario, we experimentally evaluate the performance of an MNS-enabled approach and compare it with that of several decentralized benchmark approaches. We show that an MNS enabled approach is high-performing, fault-tolerant, and scalable, so it is an appropriate approach for MRS. As a goal of the thesis, using an MNS-enabled approach, we present for the first time a comprehensive comparison of control architectures in multi-robot systems, which includes a comparison of accuracy, efficiency, speed, energy consumption, scalability, and fault tolerance. Our comparisons provide designers of multi robot systems with a better understanding for selecting the best-performing control depending on the system’s objectives. Additionally, as a separate goal, we design a high-level leader-based programmable matter, which can perform some basic primitive operations in a grid environment, and construct it using lower-level organisms. We design and implement deterministic algorithms for “curl” operation of this high-level matter, an instance of shape formation problem. We prove the correctness of the presented algorithms, analytically determine their complexity, and experimentally evaluate their performance., Doctorat en Sciences de l'ingénieur et technologie, info:eu-repo/semantics/nonPublished

Published
2022

119. Connected graph searching

Author

Barrière, Lali, Flocchini, Paola, Fomin, Fedor V., Fraigniaud, Pierre, Nisse, Nicolas, Santoro, Nicola, and Thilikos, Dimitrios M.

Published
2012
Full Text
View/download PDF

140. Disjoint Paths and Connected Subgraphs for H-Free Graphs

Author

Kern, Walter, Martin, Barnaby, Paulusma, Daniël, Smith, Siani, Leeuwen, Erik Jan van, Flocchini, Paola, Moura, Lucia, Sub Algorithms and Complexity, and Algorithms and Complexity

Subjects
Theoretical Computer Science, Computer Science(all)
Abstract

The well-known Disjoint Paths problem is to decide if a graph contains k pairwise disjoint paths, each connecting a different terminal pair from a set of k distinct pairs. We determine, with an exception of two cases, the complexity of the Disjoint Paths problem for H-free graphs. If k is fixed, we obtain the k -Disjoint Paths problem, which is known to be polynomial-time solvable on the class of all graphs for every k≥ 1. The latter does no longer hold if we need to connect vertices from terminal sets instead of terminal pairs. We completely classify the complexity of k -Disjoint Connected Subgraphs for H-free graphs, and give the same almost-complete classification for Disjoint Connected Subgraphs for H-free graphs as for Disjoint Paths.

Published
2021

141. Disjoint Paths and Connected Subgraphs for H-Free Graphs.

Author

Sub Algorithms and Complexity, Algorithms and Complexity, Kern, Walter, Martin, Barnaby, Paulusma, Daniël, Smith, Siani, Leeuwen, Erik Jan van, Flocchini, Paola, Moura, Lucia, Sub Algorithms and Complexity, Algorithms and Complexity, Kern, Walter, Martin, Barnaby, Paulusma, Daniël, Smith, Siani, Leeuwen, Erik Jan van, Flocchini, Paola, and Moura, Lucia

Published
2021

150. Tight Bounds on Distributed Exploration of Temporal Graphs

Author

Gotoh, Tsuyoshi, Flocchini, Paola, Masuzawa, Toshimitsu, and Santoro, Nicola

Subjects
Arbitrary footprint, 050101 languages & linguistics, Distributed algorithm, 05 social sciences, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, 0501 psychology and cognitive sciences, 02 engineering and technology, Mobile agents, Exploration of dynamic networks
Abstract

Temporal graphs (or evolving graphs) are time-varying graphs where time is assumed to be discrete. In this paper, we consider for the first time the problem of exploring temporal graphs of arbitrary unknown topology. We study the feasibility of exploration, under both the Fsync and Ssync schedulers, focusing on the number of agents necessary and sufficient to explore such graphs. We first consider the minimal (i.e., less restrictive) assumption on the dynamics of the graph under which exploration is still feasible: temporal connectivity. Let ℋ be the class of temporally connected graphs; we show that for any temporal graph ? ∈ ℋ the number of agents sufficient to perform exploration is related to the number of its transient edges, a parameter η(?) we call evanescence of the graph. More precisely, any ? ∈ ℋ can be explored by a team of k ≥ 2 η(?) +1 agents; this bound is tight as we prove there are ? ∈ ℋ that cannot be explored by 2 η(?) agents. We then turn our attention to the well-known stronger assumption on the dynamics of the graph, called 1-interval connectivity: the graph is connected at any time step. Let ? ⊂ ℋ be the class of these always-connected temporal graphs. For this class, we prove the existence of a difference between Fsync and Ssync when there is a bound ? on the number of edges missing at each time. In fact, we show a tight bound of 2 ? +1 on the number of agents necessary and sufficient in Ssync, and a smaller tight bound of 2 ? in Fsync. As a corollary, we re-establish two recently published bounds for 1-interval connected rings., LIPIcs, Vol. 153, 23rd International Conference on Principles of Distributed Systems (OPODIS 2019), pages 22:1-22:16

Published
2020
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results