ECAL
2001
Springer
14 years 7 days ago
2001
Springer
This paper describes the simulation of a foraging agent in an environment with a simple ecological structure, alternatively using one of three different control systems with varyi...
ECAL
2001
Springer
14 years 7 days ago
2001
Springer
Amorphous computing is a recently introduced paradigm that favours geometrical configurations. The physical layout of an amorphous computer is based on a possibly irregular and er...
ECAL
2001
Springer
14 years 7 days ago
2001
Springer
Abstract. Self-replicating structures in cellular automata have been extensively studied in the past as models of Artificial Life. However, CAs, unlike the biological cellular mod...
CP
2001
Springer
14 years 7 days ago
2001
Springer
Abstract. Selecting conformations for side-chains is an important subtask in building three-dimensional protein models. Side-chain placement is a difficult problem because of the l...
CP
2001
Springer
14 years 7 days ago
2001
Springer
In recent years, many works have been carried out to solve over-constrained problems, and more speci cally the Maximal Constraint Satisfaction Problem (Max-CSP), where the goal is ...
CP
2001
Springer
14 years 7 days ago
2001
Springer
Abstract The tcc model is a formalism for reactive concurrent constraint programming. In this paper we propose a model of temporal concurrent constraint programming which adds to t...
CP
2001
Springer
14 years 7 days ago
2001
Springer
Abstract. In distributed resource allocation a set of agents must assign their resources to a set of tasks. This problem arises in many real-world domains such as disaster rescue, ...
CP
2001
Springer
14 years 7 days ago
2001
Springer
In interactive graphical applications we often require that objects do not overlap. Such non-overlap constraints can be modelled as disjunctions of arithmetic inequalities. Unfortu...
CP
2001
Springer
14 years 7 days ago
2001
Springer
Non-binary constraint satisfaction problems (CSPs) can be solved in two different ways. We can either translate the problem into an equivalent binary one and solve it using well-e...
CP
2001
Springer
14 years 7 days ago
2001
Springer
Abstract. Applying GAC on conjunctions of constraints can lead to more powerful pruning [1]. We show that there exists a simple heuristic for deciding which constraints might be us...