2252 search results - page 367 / 451 » Lower Bounds for Dynamic Algorithms |
149
click to vote
ICALP
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We extend the basic system relations of trace inclusion, trace equivalence, simulation, and bisimulation to a quantitative setting in which propositions are interpreted n...
152
click to vote
CP
2003
Springer
15 years 11 months ago
2003
Springer
This work introduces a combinatorial optimization problem called Mars Express Memory Dumping Problem (Mex-Mdp), which arises in the European Space Agency program Mars Express. It c...
188
click to vote
CIAC
2010
Springer
15 years 11 months ago
2010
Springer
Higher order Delaunay triangulations are a generalization of the Delaunay triangulation which provides a class of well-shaped triangulations, over which extra criteria can be optim...
157
click to vote
KI
2001
Springer
15 years 10 months ago
2001
Springer
Having to cope with memory limitations is an ubiquitous issue in heuristic search. We present theoretical and practical results on new variants for exploring state-space with respe...
155
click to vote
INFOCOM
2000
IEEE
15 years 10 months ago
2000
IEEE
— We study wavelength assignment for lightpaths over WDM rings to minimize the SONET ADMs used. This problem has attracted much attention recently. However, its computation compl...