Sciweavers

1983 search results - page 21 / 397
» Competitive graph searches
Sort
View
APLAS
2005
ACM
14 years 1 months ago
Register Allocation Via Coloring of Chordal Graphs
We present a simple algorithm for register allocation which is competitive with the iterated register coalescing algorithm of George and Appel. We base our algorithm on the observa...
Fernando Magno Quintão Pereira, Jens Palsbe...
ISAAC
1999
Springer
107views Algorithms» more  ISAAC 1999»
13 years 12 months ago
Carrying Umbrellas: An Online Relocation Problem on Graphs
We introduce an online relocation problem on a graph, in which a player who walks around the nodes makes decisions on whether to relocate mobile resources, while not knowing the fu...
Jae-Ha Lee, Chong-Dae Park, Kyung-Yong Chwa
CORR
2011
Springer
170views Education» more  CORR 2011»
13 years 2 months ago
Better Bounds for Incremental Frequency Allocation in Bipartite Graphs
We study frequency allocation in wireless networks. A wireless network is modeled by an undirected graph, with vertices corresponding to cells. In each vertex we have a certain nu...
Marek Chrobak, Lukasz Jez, Jiri Sgall
ICCV
2007
IEEE
14 years 9 months ago
Introducing Curvature into Globally Optimal Image Segmentation: Minimum Ratio Cycles on Product Graphs
While the majority of competitive image segmentation methods are based on energy minimization, only few allow to efficiently determine globally optimal solutions. A graphtheoretic...
Thomas Schoenemann, Daniel Cremers
ICRA
2006
IEEE
99views Robotics» more  ICRA 2006»
14 years 1 months ago
MRSAM: a Quadratically Competitive Multi-robot Online Navigation Algorithm
— We explore an online problem where a group of robots has to find a target whose position is unknown in an unknown planar environment whose geometry is acquired by the robots d...
Shahar Sarid, Amir Shapiro, Yoav Gabriely