Sciweavers

2168 search results - page 118 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
AAAI
2010
15 years 3 months ago
Algorithms for Finding Approximate Formations in Games
Many computational problems in game theory, such as finding Nash equilibria, are algorithmically hard to solve. This limitation forces analysts to limit attention to restricted su...
Patrick R. Jordan, Michael P. Wellman
FGCS
2006
82views more  FGCS 2006»
15 years 3 months ago
PGGA: A predictable and grouped genetic algorithm for job scheduling
This paper presents a predictable and grouped genetic algorithm (PGGA) for job scheduling. The novelty of the PGGA is twofold: (1) a job workload estimati...
Maozhen Li, Bin Yu, Man Qi
STOC
2003
ACM
141views Algorithms» more  STOC 2003»
16 years 3 months ago
Better streaming algorithms for clustering problems
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storag...
Moses Charikar, Liadan O'Callaghan, Rina Panigrahy
GCC
2003
Springer
15 years 8 months ago
A Load Balancing Algorithm for Web Based Server Grids
Load balance is a critical issue in distributed systems, such as server grids. In this paper, we propose a Balanced Load Queue (BLQ) model, which combines the queuing theory and hy...
Shui Yu, John Casey, Wanlei Zhou
CORR
2010
Springer
149views Education» more  CORR 2010»
15 years 3 months ago
Group Testing with Probabilistic Tests: Theory, Design and Application
Identification of defective members of large populations has been widely studied in the statistics community under the name of group testing. It involves grouping subsets of items...
Mahdi Cheraghchi, Ali Hormati, Amin Karbasi, Marti...