400 search results - page 31 / 80 » Backtracking |
ICCS
2005
Springer
14 years 3 months ago
2005
Springer
We describe a visual interactive framework that supports the computation of syntactic unifiers of expressions with variables. Unification is specified via built-in transformatio...
ISCIS
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. We investigate the problem of enumerating schedules, consisting of course-section assignments, in increasing order of the number of conflicts they contain. We define th...
AUSAI
2004
Springer
14 years 3 months ago
2004
Springer
In this paper we introduce an Ant Colony Optimisation (ACO) algorithm to find solutions for the well-known Knight’s Tour problem. The algorithm utilizes the implicit parallelism ...
SAT
2004
Springer
14 years 3 months ago
2004
Springer
The finite model generation problem in the first-order logic is a generalization of the propositional satisfiability (SAT) problem. An essential algorithm for solving the proble...
BIRTHDAY
2001
Springer
14 years 2 months ago
2001
Springer
A uniquely parsable grammar (UPG) introduced by Morita et al. (1997) is a kind of generative grammar, where parsing can be performed without backtracking. In this paper, we invest...