2109 search results - page 91 / 422 » Solving Necklace Constraint Problems |
129
Voted
DATE
2000
IEEE
15 years 9 months ago
2000
IEEE
We address the problem of inserting repeaters, selected from a library, at feasible locations in a placed and routed network to meet user-specified delay constraints. We use mini...
146
click to vote
ENTCS
2008
15 years 5 months ago
2008
Proofs of termination in term rewriting involve solving constraints between terms coming from (parts of) the rules of the term rewriting system. A common way to deal with such con...
123
Voted
SODA
2001
ACM
15 years 6 months ago
2001
ACM
We consider worst case time bounds for NP-complete problems including 3-SAT, 3-coloring, 3-edge-coloring, and 3list-coloring. Our algorithms are based on a constraint satisfaction...
177
click to vote
ICTAI
2010
IEEE
15 years 2 months ago
2010
IEEE
This work presents the concept of Continuous Search (CS), which objective is to allow any user to eventually get their constraint solver achieving a top performance on their proble...
121
Voted
COR
2007
15 years 4 months ago
2007
The paper discusses the definition and solution of a bi-objective routing problem, namely the bi-objective covering tour problem. The bi-objective CTP is a generalization of the ...