1480 search results - page 117 / 296 » Ants can solve constraint satisfaction problems |
196
click to vote
AAAI
2010
15 years 8 months ago
2010
Forming effective coalitions is a major research challenge in AI and multi-agent systems (MAS). Coalition Structure Generation (CSG) involves partitioning a set of agents into coa...
194
click to vote
PODS
2007
ACM
16 years 6 months ago
2007
ACM
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
168
click to vote
DATE
2007
IEEE
16 years 24 days ago
2007
IEEE
This paper introduces a method and tool-support for the automatic analysis and verification of hybrid and embedded control systems, whose continuous dynamics are often modelled u...
160
click to vote
ICRA
2007
IEEE
16 years 23 days ago
2007
IEEE
Abstract— We study the problem of designing control strategies for nondeterministic transitions systems enforcing the satisfaction of Linear Temporal Logic (LTL) formulas over th...
154
click to vote
PPAM
2005
Springer
15 years 12 months ago
2005
Springer
We address a generalization of the classical 1- and 2-processor UET scheduling problem on dedicated machines. In our chromatic model of scheduling machines have non-simultaneous av...