3758 search results - page 377 / 752 » A Complete Subsumption Algorithm |
180
click to vote
DNA
2005
Springer
16 years 7 days ago
2005
Springer
The first step of the Adleman-Lipton extract model in DNA computing is the combinatorial generation of libraries. In this paper a new method is proposed for generating a initial p...
167
click to vote
ICLP
2005
Springer
16 years 7 days ago
2005
Springer
Answer set programming (ASP for short) is a declarative problem solving framework that has been recently attracting the attention of researchers for its expressiveness and for its...
154
click to vote
JSSPP
2005
Springer
16 years 6 days ago
2005
Springer
Our main goal in this paper is to study the scheduling of parallel BSP tasks on clusters of computers. We focus our attention on special characteristics of BSP tasks, which can use...
178
Voted
ICCBR
2005
Springer
16 years 5 days ago
2005
Springer
An adaptation phase is crucial for a good and reasonable Case-Based Planning (CBP) system. The adaptation phase is responsible for finding a solution in order to solve a new proble...
171
click to vote
COCO
2004
Springer
16 years 3 days ago
2004
Springer
We prove a parameterized analog of Schaefer’s Dichotomy Theorem: we show that for every finite boolean constraint family F, deciding whether a formula containing constraints fr...