2398 search results - page 288 / 480 » Constraint Programming and Graph Algorithms |
187
click to vote
VALUETOOLS
2006
ACM
16 years 9 days ago
2006
ACM
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
172
click to vote
CVPR
2004
IEEE
16 years 8 months ago
2004
IEEE
Traditionally, the problem of stereo matching has been addressed either by a local window-based approach or a dense pixel-based approach using global optimization. In this paper, ...
152
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
The scheduling of application tasks is a problem that occurs in all multiprocessor systems. This problem becomes even more complicated if the tasks are not independent but are inte...
177
click to vote
COMPLEX
2009
Springer
15 years 10 months ago
2009
Springer
Creating ensembles of random but "realistic" topologies for complex systems is crucial for many tasks such as benchmark generation and algorithm analysis. In general, exp...
199
click to vote
CIKM
2007
Springer
15 years 10 months ago
2007
Springer
We investigate the problem of how to evaluate, fast and efficiently, classes of optimal route queries on a massive graph in a unified framework. To evaluate a route query effectiv...