2109 search results - page 256 / 422 » Solving Necklace Constraint Problems |
157
click to vote
CP
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...
141
click to vote
IJCAI
1997
15 years 6 months ago
1997
Planning for real-time applications involves decisions not only about what actions to take in what states to progress toward achieving goals (the traditional decision problem face...
166
click to vote
PC
2002
15 years 4 months ago
2002
Saddle-point problems give rise to indefinite linear systems that are challenging to solve via iterative methods. This paper surveys two recent techniques for solving such problem...
157
click to vote
JALC
2006
15 years 5 months ago
2006
Automated Web Service Composition has gained a significant momentum in facilitating fast and efficient formation of business-to-business collaborations where an important objectiv...
150
click to vote
CPAIOR
2005
Springer
15 years 10 months ago
2005
Springer
We describe the problem of scheduling astronomy observations for the Stratospheric Observatory for Infrared Astronomy, an airborne telescope. The problem requires maximizing the nu...