11740 search results - page 328 / 2348 » More Problems in Rewriting |
184
click to vote
PODS
1998
ACM
15 years 11 months ago
1998
ACM
We study the complexity of the problem of answering queries using materialized views. This problem has attracted a lot of attention recently because of its relevance in data integ...
169
click to vote
KR
1989
Springer
15 years 10 months ago
1989
Springer
In this work we extend the work of Dean, Kaelbling, Kirman and Nicholson on planning under time constraints in stochastic domains to handle more complicated scheduling problems. I...
186
click to vote
AUSAI
2007
Springer
15 years 10 months ago
2007
Springer
Many real-world problems are over-constrained and require search techniques adapted to optimising cost functions rather than searching for consistency. This makes the MAX-SAT probl...
192
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
This papers presents a novel representation of classifier conditions based on convex hulls. A classifier condition is represented by a sets of points in the problem space. These p...
170
click to vote
GECCO
2000
Springer
15 years 10 months ago
2000
Springer
A mathematical formula containing one or more free variables is "general" in the sense that it represents the solution to all instances of a problem (instead of just the...