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...
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...
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 ...
Brian Hrolenok, Sean Luke, Keith Sullivan, Christo...
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...
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...