159 search results - page 23 / 32 » Computing minimum cuts by randomized search heuristics |
ATAL
2010
Springer
15 years 1 months ago
2010
Springer
The static asset protection problem (SAP) in a road network is that of allocating resources to protect vertices, given any possible behavior by an adversary determined to attack t...
111
Voted
IWANN
2009
Springer
15 years 7 months ago
2009
Springer
Generating test data for formal state based specifications is computationally expensive. This paper improves a framework that addresses this issue by representing the test data ge...
128
Voted
DCOSS
2011
Springer
14 years 5 days ago
2011
Springer
—Controlled sink mobility has been shown to be very beneficial in lifetime prolongation of wireless sensor networks (WSNs) by avoiding the typical hot-spot problem near the sink...
CIAC
2000
Springer
15 years 4 months ago
2000
Springer
We consideralgorithms for a simple one-dimensionalpoint placement problem: given N points on a line, and noisy measurements of the distances between many pairs of them, estimate th...
120
click to vote
DAM
2000
15 years 6 days ago
2000
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...