Sciweavers

3958 search results - page 402 / 792
» Dynamic Graph Algorithms with Applications
Sort
View
DIALM
2004
ACM
100views Algorithms» more  DIALM 2004»
16 years 5 days ago
Virtual coordinates for ad hoc and sensor networks
In many applications of wireless ad hoc and sensor networks, position-awareness is of great importance. Often, as in the case of geometric routing, it is sufficient to have virtua...
Thomas Moscibroda, Regina O'Dell, Mirjam Wattenhof...
147
Voted
KBSE
2003
IEEE
16 years 15 hour ago
Parallel Breadth-First Search LTL Model-Checking
We propose a practical parallel on-the-fly algorithm for enumerative LTL model-checking. The algorithm is designed for a cluster of workstations communicating via MPI. The detect...
Jiri Barnat, Lubos Brim, Jakub Chaloupka
GECCO
2008
Springer
156views Optimization» more  GECCO 2008»
15 years 7 months ago
Computing minimum cuts by randomized search heuristics
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
Frank Neumann, Joachim Reichel, Martin Skutella
ICCV
2009
IEEE
15 years 4 months ago
Minimizing energy functions on 4-connected lattices using elimination
We describe an energy minimization algorithm for functions defined on 4-connected lattices, of the type usually encountered in problems involving images. Such functions are often ...
Peter Carr, Richard Hartley
ICPP
2006
IEEE
16 years 24 days ago
Using Gossip for Dynamic Resource Discovery
— Resource discovery is the process of locating shared resources on a computer network. Previously studied examples include efficiently finding files with a given title on a ...
Eric Simonton, Byung Kyu Choi, Steven Seidel