2398 search results - page 169 / 480 » Constraint Programming and Graph Algorithms |
171
click to vote
PODS
2002
ACM
16 years 6 months ago
2002
ACM
In multidimensional data models intended for online analytic processing (OLAP), data are viewed as points in a multidimensional space. Each dimension has structure, described by a...
170
click to vote
PPOPP
2010
ACM
16 years 3 months ago
2010
ACM
Irregular algorithms are organized around pointer-based data structures such as graphs and trees, and they are ubiquitous in applications. Recent work by the Galois project has pr...
193
click to vote
CONSTRAINTS
2002
15 years 6 months ago
2002
It is a challenging task for a team of multiple fast-moving robots to cooperate with each other and to compete with another team in a dynamic, real-time environment. For a robot te...
175
Voted
DAC
2009
ACM
16 years 7 months ago
2009
ACM
Boolean satisfiability (SAT) solvers are used heavily in hardware and software verification tools for checking satisfiability of Boolean formulas. Most state-of-the-art SAT solver...
185
click to vote
CP
1997
Springer
15 years 10 months ago
1997
Springer
Feature trees have been used to accommodate records in constraint programming and record like structures in computational linguistics. Feature trees model records, and feature cons...