Sciweavers

432 search results - page 10 / 87
» An optimal algorithm for the distinct elements problem
Sort
View
ECCC
2011
282views ECommerce» more  ECCC 2011»
13 years 2 months ago
Almost k-wise vs. k-wise independent permutations, and uniformity for general group actions
A family of permutations in Sn is k-wise independent if a uniform permutation chosen from the family maps any distinct k elements to any distinct k elements equally likely. Effici...
Noga Alon, Shachar Lovett
FOCS
2000
IEEE
14 years 4 hour ago
Optimization Problems in Congestion Control
One of the crucial elements in the Internet’s success is its ability to adequately control congestion. This paper defines and solves several optimization problems related to In...
Richard M. Karp, Elias Koutsoupias, Christos H. Pa...
WADS
2005
Springer
111views Algorithms» more  WADS 2005»
14 years 1 months ago
Near-Optimal Pricing in Near-Linear Time
We present efficient approximation algorithms for a number of problems that call for computing the prices that maximize the revenue of the seller on a set of items. Algorithms for ...
Jason D. Hartline, Vladlen Koltun
ATAL
2009
Springer
14 years 2 months ago
Easy and hard coalition resource game formation problems: a parameterized complexity analysis
Coalition formation is a key topic in multi–agent systems (mas). Coalitions enable agents to achieve goals that they may not have been able to achieve independently, and encoura...
Tammar Shrot, Yonatan Aumann, Sarit Kraus
GECCO
2003
Springer
123views Optimization» more  GECCO 2003»
14 years 24 days ago
Benefits of Implicit Redundant Genetic Algorithms for Structural Damage Detection in Noisy Environments
A robust structural damage detection method that can handle noisy frequency response function information is discussed. The inherent unstructured nature of damage detection problem...
Anne M. Raich, Tamás Liszkai