920 search results - page 14 / 184 » Generating Satisfiable Problem Instances |
130
Voted
EC
2008
15 years 26 days ago
2008
The development of successful metaheuristic algorithms such as local search for a difficult problems such as satisfiability testing (SAT) is a challenging task. We investigate an ...
86
Voted
ICCAD
2002
IEEE
15 years 9 months ago
2002
IEEE
Within the verification community, there has been a recent increase in interest in Quantified Boolean Formula evaluation (QBF) as many interesting sequential circuit verification ...
110
Voted
BCS
2008
15 years 2 months ago
2008
Digital circuits with feedback loops can solve some instances of NP-hard problems by relaxation: the circuit will either oscillate or settle down to a stable state that represents...
87
Voted
DATAMINE
2007
15 years 23 days ago
2007
Recent work has looked at extending clustering algorithms with instance level must-link (ML) and cannot-link (CL) background information. Our work introduces δ and ǫ cluster lev...
100
Voted
COR
2007
15 years 23 days ago
2007
Column generation has proven to be efficient in solving the linear programming relaxation of large scale instances ofthemultiple-depotvehicleschedulingproblem(MDVSP).Howeverdif...