805 search results - page 100 / 161 » Enumerating All Solutions for Constraint Satisfaction Proble... |
135
click to vote
AAAI
2007
15 years 6 months ago
2007
In recent years, the size of combinatorial applications and the need to produce high-quality solutions quickly have increased steadily, providing significant challenges for optim...
163
click to vote
STOC
2006
ACM
16 years 4 months ago
2006
ACM
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
175
click to vote
MP
2011
14 years 11 months ago
2011
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in machine learning, control theory, and discrete geometry. This c...
134
click to vote
COR
2010
15 years 4 months ago
2010
In many real-life optimisation problems, there are multiple interacting components in a solution. For example, different components might specify assignments to different kinds of...
149
click to vote
RTSS
1992
IEEE
15 years 8 months ago
1992
IEEE
This paper addresses the problem of allocating (assigning and scheduling) periodic task modules to processing nodes in distributed real-time systems subject to task precedence and ...