2109 search results - page 142 / 422 » Solving Necklace Constraint Problems |
188
click to vote
SARA
2009
Springer
16 years 18 days ago
2009
Springer
We study novel approaches for solving of hard combinatorial problems by translation to Boolean Satisfiability (SAT). Our focus is on combinatorial problems that can be represented...
181
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
In this paper we study the constrained consensus problem, i.e. the problem of reaching a common point from the estimates generated by multiple agents that are constrained to lie in...
171
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Index tuning, i.e., selecting the indexes appropriate for a workload, is a crucial problem in database system tuning. In this paper, we solve index tuning for large problem instan...
171
click to vote
ICASSP
2011
IEEE
14 years 9 months ago
2011
IEEE
This paper presents a fast algorithm for restoring video sequences. The proposed algorithm, as opposed to existing methods, does not consider video restoration as a sequence of im...
168
click to vote
AIMSA
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Constraint Satisfaction has been widely used to model static combinatorial problems. However, many AI problems are dynamic and take place in a distributed environment, i....