4894 search results - page 567 / 979 » The Guarding Problem - Complexity and Approximation |
146
click to vote
ICANN
2003
Springer
15 years 10 months ago
2003
Springer
Model based learning systems usually face to a problem of forgetting as a result of the incremental learning of new instances. Normally, the systems have to re-learn past instances...
143
click to vote
3DPVT
2002
IEEE
15 years 9 months ago
2002
IEEE
We consider the problem of computing stereo correspondence for scenes dense in physical structure, such as a bouquet of flowers. Boundaries are then space curves, formally govern...
138
click to vote
HM
2009
Springer
15 years 9 months ago
2009
Springer
We present a hybrid solver (called GELATO) that exploits the potentiality of a Constraint Programming (CP) environment (Gecode) and of a Local Search (LS) framework (EasyLocal++ )....
141
click to vote
VISUALIZATION
2000
IEEE
15 years 9 months ago
2000
IEEE
We present a new algorithm for material boundary interface reconstruction from data sets containing volume fractions. We transform the reconstruction problem to a problem that ana...
158
click to vote
CP
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. This paper evaluates the power of a new scheme that generates search heuristics mechanically. This approach was presented and evaluated rst in the context of optimization...