2109 search results - page 86 / 422 » Solving Necklace Constraint Problems |
174
click to vote
AAAI
2010
15 years 6 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...
145
click to vote
MICAI
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Classical constraint satisfaction problems (CSPs) provide an expressive formalism for describing and solving many real-world problems. However, classical CSPs prove to be...
141
click to vote
DATE
2007
IEEE
15 years 11 months 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...
141
Voted
NA
2010
15 years 3 months ago
2010
In the past decade or so, semi-definite programming (SDP) has emerged as a powerful tool capable of handling a remarkably wide range of problems. This article describes an innovat...
148
click to vote
ICCBR
2005
Springer
15 years 10 months ago
2005
Springer
Constraint programming is a powerful paradigm that offers many different strategies for solving problems. Choosing a good strategy is difficult; choosing a poor strategy wastes r...