566 search results - page 67 / 114 » Solution Reuse in Dynamic Constraint Satisfaction Problems |
102
Voted
ASPDAC
2005
ACM
15 years 6 months ago
2005
ACM
With impressive progress in Boolean Satisfiability (SAT) solving and several extensions to pseudo-Boolean (PB) constraints, many applications that use SAT, such as highperformanc...
111
Voted
LATIN
2010
Springer
14 years 11 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...
125
Voted
JMLR
2010
14 years 7 months ago
2010
We consider the problem of reducing the dimensionality of labeled data for classification. Unfortunately, the optimal approach of finding the low-dimensional projection with minim...
99
Voted
ISLPED
2009
ACM
15 years 7 months ago
2009
ACM
Increasing power densities and the high cost of low thermal resistance packages and cooling solutions make it impractical to design processors for worst-case temperature scenarios...
151
Voted
CDC
2010
IEEE
14 years 7 months ago
2010
IEEE
In this paper we study the human eye movement and the head movement system as a simple mechanical control system. Most of the time, eye movements obey Listing's constraint, wh...