566 search results - page 60 / 114 » Solution Reuse in Dynamic Constraint Satisfaction Problems |
119
click to vote
CDC
2009
IEEE
15 years 5 months ago
2009
IEEE
Abstract— We study the problem of maximizing the aggregated revenue in sensor networks with deadline constraints. Our model is that of a sensor network that is arranged in the fo...
93
Voted
CSCLP
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. In [8], Freuder defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently [2], we extended the definition of interchangeability to Soft ...
111
click to vote
STOC
2006
ACM
16 years 24 days ago
2006
ACM
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...
120
Voted
CP
2011
Springer
14 years 8 days ago
2011
Springer
We introduce tractable classes of VCSP instances based on convex cost functions. Firstly, we show that the class of VCSP instances satisfying the hierarchically nested convexity pr...
105
click to vote
AIMSA
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. The problem of curriculum-based course timetabling is studied in this work. In addition to formally defining the problem, we present a hybrid solution algorithm (Adaptiv...