1603 search results - page 144 / 321 » Universal Confidence Sets for Solutions of Optimization Prob... |
204
click to vote
APPROX
2005
Springer
16 years 3 days ago
2005
Springer
We study the partial vertex cover problem. Given a graph G = (V, E), a weight function w : V → R+ , and an integer s, our goal is to cover all but s edges, by picking a set of v...
163
click to vote
WSC
2004
15 years 8 months ago
2004
Simulation plays a vital role in identifying the best system design from among a set of competing designs. To improve simulation efficiency, ranking and selection techniques are o...
212
click to vote
CSL
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We present decision procedures for logical constraints involving collections such as sets, multisets, and fuzzy sets. Element membership in our collections is given by ch...
190
click to vote
EPS
1998
Springer
15 years 10 months ago
1998
Springer
This paper reports work investigating various evolutionary approaches to vertex cover (VC), a well-known NP-Hard optimization problem. Central to each of the algorithms is a novel ...
143
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
We present an evolutionary methodology that explores the evolution of network topology when a uniform growth of the network traffic is considered. The network redesign problem is ...