Sciweavers

2612 search results - page 283 / 523
» Switching Graphs and Their Complexity
Sort
View
CORR
2004
Springer
119views Education» more  CORR 2004»
15 years 4 months ago
The Largest Compatible Subset Problem for Phylogenetic Data
Abstract. The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfec...
Andy Auyeung, Ajith Abraham
128
Voted
ICRA
2010
IEEE
154views Robotics» more  ICRA 2010»
15 years 3 months ago
Multi-agent path planning with multiple tasks and distance constraints
— The DPC algorithm developed in our previous work is an efficient way of computing optimal trajectories for multiple robots in a distributed fashion with timeparameterized cons...
Subhrajit Bhattacharya, Maxim Likhachev, Vijay Kum...
170
Voted
ISAAC
2010
Springer
226views Algorithms» more  ISAAC 2010»
15 years 3 months ago
On Tractable Cases of Target Set Selection
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
André Nichterlein, Rolf Niedermeier, Johann...
SAC
2011
ACM
14 years 7 months ago
A semantically rich approach for collaborative model edition
We propose a novel approach and tool for collaborative software engineering and development. In model-based software engineering, the underlying data structure is a complex, direc...
Jonathan Michaux, Xavier Blanc, Marc Shapiro, Pier...
STACS
2012
Springer
14 years 18 days ago
Low Randomness Rumor Spreading via Hashing
We consider the classical rumor spreading problem, where a piece of information must be disseminated from a single node to all n nodes of a given network. We devise two simple pus...
George Giakkoupis, Thomas Sauerwald, He Sun, Phili...