419 search results - page 68 / 84 » An LP-Designed Algorithm for Constraint Satisfaction |
AI
1998
Springer
14 years 20 days ago
1998
Springer
Abstract. The general timetabling problem is an assignment of activities to xed time intervals, adhering to a prede ned set of resource availabilities. Timetabling problems are di ...
ECAI
2006
Springer
14 years 3 days ago
2006
Springer
Several formalisms exist to express and solve decision problems. Each is designed to capture different kinds of knowledge: utilities expressing preferences, uncertainties on the en...
AAAI
2007
13 years 10 months ago
2007
In many sensing applications we must continuously gather information to provide a good estimate of the state of the environment at every point in time. A robot may tour an environ...
TALG
2010
13 years 6 months ago
2010
Fractional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its algorithmic importance comes from the fact that, as shown in previous work [14], ...
LATIN
2010
Springer
13 years 6 months ago
2010
Springer
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...