Instances of constraint satisfaction problems can be solved efficiently if they are representable as a tree decomposition of small width. Unfortunately, the task of finding a decomposition of minimum width is NP-complete itself. Therefore, several heuristic and metaheuristic methods have been developed for this problem. In this paper we investigate the application of different variants of Ant C...

Many problems in multi-agent systems can be described as Distributed Constraint Satisfaction Problems (Distributed CSPs), where the goal is to nd a set of assignments to variables that satis es all constraints among agents. However, when real-life application problems are formalized as Distributed CSPs, they are often over-constrained and have no solution that satis es all constraints. This pap...

In this paper we analyze a two-dimensional discrete model of nearestneighbour Lennard-Jones interactions under the microscopical constraint that points on a lattice triangle maintain their order. This can be understood as a microscopical non-interpenetration constraint and amounts to the positiveness of the determinant of the gradient of the piecewiseaffine interpolations of the discrete displa...

| Optical networks based on passive-star couplers and employing wavelength division multiplexing (WDM) have been proposed for deployment in local and metropolitan areas. These networks suuer from splitting, coupling, and attenuation losses. Since there is an upper bound on transmitter power and a lower bound on receiver sensitivity , optical ampliiers are usually required to compensate for the ...

Optical networks based on passive star couplers and employing wavelength-division multi-plexing (WDM) have been proposed for deployment in local and metropolitan areas. These networks suuer from splitting, coupling, and attenuation losses. Since there is an upper bound on transmitter power and a lower bound on receiver sensitivity, optical ampliiers are usually required to compensate for the po...

The timetabling problem of local Elderly Day Care Centers (EDCCs) is formulated into a weighted maximum constraint satisfaction problem (Max-CSP) in this study. The EDCC timetabling problem is a multi-dimensional assignment problem, where users (elderly) are required to perform activities that require different venues and timeslots, depending on operational constraints. These constraints are ca...

The paper presents an extension of the concurrent constraint model providing for higher-order programming, deep guards, and encapsulated search. The paper focuses on a higher-order combinator providing for encapsulated search. The search combinator spawns a local computation space and resolves remaining choices by returning the alternatives as rst-class citizens. The search combinator allows to...

This work integrates three related AI search techniques and applies the result to processing computational semantics both in the analysis of source text to discover underlying semantics as well as in the planning of target text using input semantics We summarize the approach as Hunter Gatherer Branch and Bound and Constraint Satisfaction allow us to hunt down non optimal and impossible solution...

GloptLab is an easy-to-use testing and development platform for solving quadratic constraint satisfaction problems, written in Matlab. The algorithms implemented in GloptLab are used to reduce the search space: scaling, constraint propagation, linear relaxations, strictly convex enclosures, conic methods, and branch and bound. All these methods are rigorous, hence it is guaranteed that no feasi...

We consider a transport system problem which involves route planning for vehicles with containers attached, and cargo accommodation. The specific problem considered is the vehicle routing problem with loading constraints. Its input consists of a weighted undirected graph where vertices corresponds to clients and edges costs represents the cost to move the vehicle along that edge. Each vertex ha...