Sciweavers

10935 search results - page 1876 / 2187
» Neural Programming Language
Sort
View
101
Voted
CP
2004
Springer
15 years 8 months ago
Computing the Frequency of Partial Orders
In this paper we study four algorithms for computing the frequency of a given partial order. Here the frequency of a partial order is the number of standard labellings respecting t...
Marc R. C. van Dongen
128
Voted
CP
2004
Springer
15 years 8 months ago
Counting-Based Look-Ahead Schemes for Constraint Satisfaction
Abstract. The paper presents a new look-ahead scheme for backtracking search for solving constraint satisfaction problems. This look-ahead scheme computes a heuristic for value ord...
Kalev Kask, Rina Dechter, Vibhav Gogate
126
Voted
CP
2004
Springer
15 years 8 months ago
Quality of LP-Based Approximations for Highly Combinatorial Problems
We study the quality of LP-based approximation methods for pure combinatorial problems. We found that the quality of the LPrelaxation is a direct function of the underlying constra...
Lucian Leahu, Carla P. Gomes
117
Voted
CP
2004
Springer
15 years 8 months ago
Speeding Up Constraint Propagation
This paper presents a model and implementation techniques for speeding up constraint propagation. Two fundamental approaches to improving constraint propagation are explored: keepi...
Christian Schulte, Peter J. Stuckey
124
Voted
DEXA
2004
Springer
180views Database» more  DEXA 2004»
15 years 8 months ago
Algebra-to-SQL Query Translation for Spatio-Temporal Databases
Although many spatio-temporal conceptual models has been proposed in the last years, users must express their queries on the underlying physical data structures. In the context of ...
Mohammed Minout, Esteban Zimányi
« Prev « First page 1876 / 2187 Last » Next »