192 search results - page 22 / 39 » On-Demand Bound Computation for Best-First Constraint Optimi... |
GD
2005
Springer
15 years 3 months ago
2005
Springer
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
MASS
2010
14 years 7 months ago
2010
We study a problem in which a single sensor is scheduled to observe sites periodically, motivated by applications in which the goal is to maintain up-to-date readings for all the o...
3DIM
2005
IEEE
14 years 11 months ago
2005
IEEE
We give a formal definition of geometric fitting in a way that suits computer vision applications. We point out that the performance of geometric fitting should be evaluated in...
MP
2008
14 years 9 months ago
2008
Multistage stochastic programs have applications in many areas and support policy makers in finding rational decisions that hedge against unforeseen negative events. In order to en...
78
Voted
IPPS
2007
IEEE
15 years 4 months ago
2007
IEEE
Replicating data objects onto servers across a system can alleviate access delays. The selection of data objects and servers requires solving a constraint optimization problem, wh...