Sciweavers

417 search results - page 82 / 84
» Running Time Predictions for Factoring Algorithms
Sort
View
FOCS
2007
IEEE
15 years 3 months ago
Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
Daniel Stefankovic, Santosh Vempala, Eric Vigoda
ISAAC
2005
Springer
127views Algorithms» more  ISAAC 2005»
15 years 3 months ago
Decision Making Based on Approximate and Smoothed Pareto Curves
Abstract. We consider bicriteria optimization problems and investigate the relationship between two standard approaches to solving them: (i) computing the Pareto curve and (ii) the...
Heiner Ackermann, Alantha Newman, Heiko Rögli...
ACMACE
2009
ACM
15 years 4 months ago
iSee: interactive scenario explorer for online tournament games
Fantasy games, in which players compete to correctly predict realworld outcomes in sports, entertainment, and politics, have grown in popularity and now represent a significant po...
Greg Smith, Desney S. Tan, Bongshin Lee
EENERGY
2010
15 years 1 months ago
Towards energy-aware scheduling in data centers using machine learning
As energy-related costs have become a major economical factor for IT infrastructures and data-centers, companies and the research community are being challenged to find better an...
Josep Lluis Berral, Iñigo Goiri, Ramon Nou,...
MOBISYS
2010
ACM
14 years 12 months ago
CrowdSearch: exploiting crowds for accurate real-time image search on mobile phones
Mobile phones are becoming increasingly sophisticated with a rich set of on-board sensors and ubiquitous wireless connectivity. However, the ability to fully exploit the sensing c...
Tingxin Yan, Vikas Kumar, Deepak Ganesan