3808 search results - page 634 / 762 » Artificial Intelligence: A Modern Approach |
185
click to vote
CP
2005
Springer
16 years 16 hour 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...
157
click to vote
EPIA
2005
Springer
16 years 12 hour ago
2005
Springer
The amount of information about the genome, transcriptome and proteome, forms a problem for the scientific community: how to find the right information in a reasonable amount of ...
170
click to vote
GECCO
2005
Springer
16 years 6 hour ago
2005
Springer
In this paper, the parameters of a genetic network for rice flowering time control have been estimated using a multiobjective genetic algorithm approach. We have modified the rece...
173
click to vote
CP
2004
Springer
15 years 12 months ago
2004
Springer
In CP literature combinatorial design problems such as sport scheduling, Steiner systems, error-correcting codes and more, are typically solved using Finite Domain (FD) models desp...
144
click to vote
CP
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. The Quasigroup Completion Problem (QCP) is a very challenging benchmark among combinatorial problems, and the focus of much recent interest in the area of constraint prog...