724 search results - page 101 / 145 » Practical Performance of Efficient Minimum Cut Algorithms |
163
click to vote
SIAMIS
2010
14 years 9 months ago
2010
Simulated annealing (SA) and deterministic continuation are well-known generic approaches to global optimization. Deterministic continuation is computationally attractive but produ...
112
click to vote
SODA
2003
ACM
15 years 4 months ago
2003
ACM
We tackle the problem of online paging on two level memories with arbitrary associativity (including victim caches, skewed caches etc.). We show that some important classes of pag...
131
click to vote
MOBIHOC
2010
ACM
15 years 29 days ago
2010
ACM
Barrier coverage is a critical issue in wireless sensor networks for various battlefield and homeland security applications. The goal is to effectively detect intruders that attem...
122
click to vote
CHI
2002
ACM
16 years 3 months ago
2002
ACM
In a ten-session experiment, six participants practiced typing with an expanding rehearsal method on an optimized virtual keyboard. Based on a large amount of in-situ performance ...
134
click to vote
APPROX
2000
Springer
15 years 7 months ago
2000
Springer
In this paper, we derive bounds on performance guarantees of online algorithms for real-time preemptive scheduling of jobs with deadlines on K machines when jobs are characterized ...