13026 search results - page 2400 / 2606 » Creativity and Artificial Intelligence |
163
click to vote
CP
2005
Springer
16 years 6 days ago
2005
Springer
Abstract. Multi-Point Constructive Search maintains a small set of “elite solutions” that are used to heuristically guide constructive search through periodically restarting se...
171
Voted
CP
2005
Springer
16 years 6 days ago
2005
Springer
Abstract. In an increasing number of domains such as bioinformatics, combinatorial graph problems arise. We propose a novel way to solve these problems, mainly those that can be tr...
152
click to vote
CP
2005
Springer
16 years 6 days ago
2005
Springer
The aggregation of individuals’ preferences into a single group outcome is both well-studied and fundamental within decision theory. Historically, though, a pervasive simplifica...
188
click to vote
CP
2005
Springer
16 years 6 days ago
2005
Springer
In this paper we show how Constraint Programming (CP) techniques can improve the efficiency and applicability of grid-based algorithms for optimising surface contact between comple...
175
click to vote
CP
2005
Springer
16 years 6 days ago
2005
Springer
The two most popular backtrack algorithms for solving Constraint Satisfaction Problems (CSPs) are Forward Checking (FC) and Maintaining Arc Consistency (MAC). MAC maintains full ar...