2340 search results - page 173 / 468 » Copying and Comparing: Problems and Solutions |
196
Voted
KI
2007
Springer
16 years 1 months ago
2007
Springer
We introduce a novel stochastic local search algorithm for the vertex cover problem. Compared to current exhaustive search techniques, our algorithm achieves excellent performance ...
202
Voted
CPM
2005
Springer
16 years 17 days ago
2005
Springer
In this paper we propose new solution methods for designing tag sets for use in universal DNA arrays. First, we give integer linear programming formulations for two previous formal...
188
Voted
ISPD
2004
ACM
16 years 14 days ago
2004
ACM
Considering the voltage drop constraint over a distributed model for power/ground (P/G) network, we study the following two problems for physical synthesis of sleep transistors: t...
211
Voted
CSC
2009
15 years 8 months ago
2009
- The Traveling Salesman Problem (TSP) is perhaps the most famous optimization problem in the set NP-hard. Many problems that are natural applications in computer science and engin...
186
click to vote
JGO
2008
15 years 7 months ago
2008
Two-stage stochastic mixed-integer programming (SMIP) problems with recourse are generally difficult to solve. This paper presents a first computational study of a disjunctive cut...