Sciweavers

942 search results - page 69 / 189
» Distance Constraint Satisfaction Problems
Sort
View
IDEAL
2003
Springer
15 years 3 months ago
Agent Compromises in Distributed Problem Solving
ERA is a multi-agent oriented method for solving constraint satisfaction problems [5]. In this method, agents make decisions based on the information obtained from their environmen...
Yi Tang, Jiming Liu, Xiaolong Jin
CDC
2010
IEEE
183views Control Systems» more  CDC 2010»
14 years 5 months ago
Application of potent potential functions in eye/head movement control
In this paper we study the human eye movement and the head movement system as a simple mechanical control system. Most of the time, eye movements obey Listing's constraint, wh...
Bijoy K. Ghosh, Indika Wijayasinghe
CONSTRAINTS
2000
96views more  CONSTRAINTS 2000»
14 years 9 months ago
A Comparison of Traditional and Constraint-based Heuristic Methods on Vehicle Routing Problems with Side Constraints
The vehicle routing problem (VRP) is a variant of the familiar travelling salesperson problem (TSP). In the VRP we are to perform a number of visits, using a number of vehicles of ...
Philip Kilby, Patrick Prosser, Paul Shaw
ECAI
2006
Springer
15 years 1 months ago
Enhancing Constraints Manipulation in Semiring-Based Formalisms
Abstract. Many "semiring-like" structures are used in Soft Constraint Satisfaction Problems (SCSPs). We review a few properties of semirings that are useful for dealing w...
Stefano Bistarelli, Fabio Gadducci
ECSQARU
2009
Springer
14 years 7 months ago
Soft Constraints Processing over Divisible Residuated Lattices
We claim that divisible residuated lattices (DRLs) can act as a unifying evaluation framework for soft constraint satisfaction problems (soft CSPs). DRLs form the algebraic semanti...
Simone Bova