210 search results - page 24 / 42 » Some Competition Programming Problems as the Beginning of Ar... |
CP
2001
Springer
15 years 1 months ago
2001
Springer
Abstract. Computing lower bounds to the best-cost extension of a tuple is an ubiquous task in constraint optimization. A particular case of special interest is the computation of l...
ISMIS
1999
Springer
15 years 1 months ago
1999
Springer
Software quality prediction can be cast as a concept learning problem. In this paper, we discuss the full cycle of an application of Machine Learning to software quality predictio...
159
click to vote
ASP
2005
Springer
15 years 3 months ago
2005
Springer
Preferences are useful when the space of feasible solutions of a given problem is dense but not all these solutions are equivalent w.r.t. some additional requirements. In this case...
ATAL
2009
Springer
15 years 4 months ago
2009
Springer
Poker games provide a useful testbed for modern Artificial Intelligence techniques. Unlike many classical game domains such as chess and checkers, poker includes elements of impe...
CSCLP
2007
Springer
15 years 3 months ago
2007
Springer
Global constraints are used in constraint programming to help users specify patterns that occur frequently in the real world. In addition, global constraints facilitate the use of ...