592 search results - page 72 / 119 » Using Constraint Programming to Solve the Maximum Clique Pro... |
158
click to vote
FOCS
2006
IEEE
15 years 9 months ago
2006
IEEE
Combinatorial allocation problems require allocating items to players in a way that maximizes the total utility. Two such problems received attention recently, and were addressed ...
135
click to vote
CP
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...
126
click to vote
ISSTA
2010
ACM
15 years 7 months ago
2010
ACM
Whitebox fuzzing is a novel form of security testing based on dynamic symbolic execution and constraint solving. Over the last couple of years, whitebox fuzzers have found many ne...
131
click to vote
MP
2006
15 years 3 months ago
2006
Mixed integer programming (MIP) formulations are typically tightened through the use of a separation algorithm and the addition of violated cuts. Using extended formulations involv...
116
click to vote
ISCAS
1994
IEEE
15 years 7 months ago
1994
IEEE
Earlier research has shown that the problem of optimal weighted median filtering with structural constraints can be formulated as a nonconvex nonlinear programming problem in gene...