526 search results - page 43 / 106 » Generalized benchmark generation for dynamic combinatorial p... |
145
Voted
IJCAI
2007
15 years 5 months ago
2007
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
161
Voted
ENDM
2010
15 years 1 months ago
2010
In the past decade, significant progress has been achieved in developing generic primal heuristics that made their way into commercial mixed integer programming (MIP) solver. Exte...
125
Voted
DAC
2003
ACM
16 years 4 months ago
2003
ACM
Functional verification is widely acknowledged as the bottleneck in the hardware design cycle. This paper addresses one of the main challenges of simulation based verification (or...
115
Voted
ICMCS
1999
IEEE
15 years 8 months ago
1999
IEEE
Hidden copyright marks have been proposed as a solution for solving the illegal copying and proof of ownership problems in the context of multimedia objects. Many systems have been...
112
Voted
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
There has been a considerable body of work on search–based test data generation for branch coverage. However, hitherto, there has been no work on multi–objective branch covera...