Sciweavers

198 search results - page 18 / 40
» Anytime Bounded Rationality
Sort
View
IJCAI
2007
14 years 11 months ago
Optimal Soft Arc Consistency
The Valued (VCSP) framework is a generic optimization framework with a wide range of applications. Soft arc consistency operations transform a VCSP into an equivalent problem by s...
Martin C. Cooper, Simon de Givry, Thomas Schiex
CSCLP
2008
Springer
14 years 11 months ago
IDB-ADOPT: A Depth-First Search DCOP Algorithm
Abstract. Many agent coordination problems can be modeled as distributed constraint optimization problems (DCOPs). ADOPT is an asynchronous and distributed search algorithm that is...
William Yeoh, Ariel Felner, Sven Koenig
SMI
2005
IEEE
181views Image Analysis» more  SMI 2005»
15 years 3 months ago
A Tracing Algorithm for Constructing Medial Axis Transform of 3D Objects Bound by Free-Form Surfaces
This paper presents an algorithm for generating the Medial Axis Transform(MAT) of 3D objects with free-form boundaries. The algorithm proposed uses the exact representation of the...
M. Ramanathan, B. Gurumoorthy
CORR
2011
Springer
147views Education» more  CORR 2011»
14 years 4 months ago
On Reachability for Hybrid Automata over Bounded Time
This paper investigates the time-bounded version of the reachability problem for hybrid automata. This problem asks whether a given hybrid automaton can reach a given target locat...
Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, J...
ATAL
2007
Springer
15 years 3 months ago
An equal excess negotiation algorithm for coalition formation
Coalition formation is an important form of interaction in multiagent systems. It enables the agents to satisfy tasks that they would otherwise be unable to perform, or would perf...
Hrishikesh J. Goradia, José M. Vidal