400 search results - page 11 / 80 » Backtracking |
KR
1992
Springer
14 years 1 months ago
1992
Springer
This paper studies a version of the job shop scheduling problem in which some operations have to be scheduled within non-relaxable time windows i.e. earliest latest possible start...
BMCBI
2011
13 years 1 months ago
2011
Background: Pairwise sequence alignment methods are widely used in biological research. The increasing number of sequences is perceived as one of the upcoming challenges for seque...
ACRI
2008
Springer
14 years 4 months ago
2008
Springer
In several cases, the DNA sequences of an organism are available in different stages of its evolution and it is desirable to reconstruct the DNA sequence in a previous evolution st...
APN
2007
Springer
14 years 3 months ago
2007
Springer
This paper presents the ComBack method for explicit state space exploration. The ComBack method extends the well-known hash compaction method such that full coverage of the state s...
AI
2003
Springer
14 years 3 months ago
2003
Springer
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...