466 search results - page 69 / 94 » Preprocessing Search Spaces for Branch and Bound Search |
181
click to vote
AI
2010
Springer
15 years 6 months ago
2010
Springer
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
171
click to vote
AAAI
2008
15 years 8 months ago
2008
Agents often have to construct plans that obey resource limits for continuous resources whose consumption can only be characterized by probability distributions. While Markov Deci...
152
click to vote
ISAAC
2007
Springer
16 years 4 days ago
2007
Springer
Social networks support efficient decentralized search: people can collectively construct short paths to a specified target in the network. Rank-based friendship—where the prob...
166
click to vote
NIPS
2004
15 years 7 months ago
2004
We give a fast rejection scheme that is based on image segments and demonstrate it on the canonical example of face detection. However, instead of focusing on the detection step w...
143
click to vote
CVGIP
2006
15 years 6 months ago
2006
We present a method for synthesizing animations of autonomous space, water, and land-based vehicles in games or other interactive simulations. Controlling the motion of such vehic...