1407 search results - page 181 / 282 » Join-Graph Propagation Algorithms |
BMVC
1998
13 years 10 months ago
1998
We present a simple and efficient dense matching method based on region growing techniques, which can be applied to a wide range of globally textured images like many outdoor scen...
AIPS
1996
13 years 10 months ago
1996
Weshowthat by inferring parametexdomainsof planningoperators,given the definitions of the operators and the initial and goal conditions, we can often speed up the planning process...
ATAL
2010
Springer
13 years 10 months ago
2010
Springer
A classic example of multiagent coordination in a shared environment involves the use of pheromone deposits as a communication mechanism. Due to physical limitations in deploying ...
ANOR
2008
13 years 9 months ago
2008
This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc...