Sciweavers

4377 search results - page 693 / 876
» Mass problems and randomness
Sort
View
ESA
2009
Springer
142views Algorithms» more  ESA 2009»
16 years 21 days ago
An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-Time Scheduling
We introduce the First Fit Matching Periods algorithm for rate-monotonic multiprocessor scheduling of periodic tasks with implicit deadlines and show that it yields asymptotically...
Andreas Karrenbauer, Thomas Rothvoß
151
Voted
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
16 years 21 days ago
Sparse Cut Projections in Graph Streams
Finding sparse cuts is an important tool for analyzing large graphs that arise in practice, such as the web graph, online social communities, and VLSI circuits. When dealing with s...
Atish Das Sarma, Sreenivas Gollapudi, Rina Panigra...
149
Voted
GECCO
2009
Springer
141views Optimization» more  GECCO 2009»
16 years 21 days ago
Distributed hyper-heuristics for real parameter optimization
Hyper-heuristics (HHs) are heuristics that work with an arbitrary set of search operators or algorithms and combine these algorithms adaptively to achieve a better performance tha...
Marco Biazzini, Balázs Bánhelyi, Alb...
ICB
2009
Springer
137views Biometrics» more  ICB 2009»
16 years 21 days ago
Direct Pore Matching for Fingerprint Recognition
Abstract. Sweat pores on fingerprints have proven to be useful features for personal identification. Several methods have been proposed for pore matching. The state-of-the-art meth...
Qijun Zhao, Lei Zhang, David Zhang, Nan Luo
ICISS
2009
Springer
16 years 21 days ago
Making Peer-Assisted Content Distribution Robust to Collusion Using Bandwidth Puzzles
Many peer-assisted content-distribution systems reward a peer based on the amount of data that this peer serves to others. However, validating that a peer did so is, to our knowled...
Michael K. Reiter, Vyas Sekar, Chad Spensky, Zheng...