Sciweavers

1289 search results - page 154 / 258
» Complexity of Counting the Optimal Solutions
Sort
View
STOC
2006
ACM
132views Algorithms» more  STOC 2006»
15 years 10 months ago
Near-optimal algorithms for unique games
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...
Moses Charikar, Konstantin Makarychev, Yury Makary...
ICAC
2008
IEEE
15 years 4 months ago
Generating Adaptation Policies for Multi-tier Applications in Consolidated Server Environments
Creating good adaptation policies is critical to building complex autonomic systems since it is such policies that define the system configuration used in any given situation. W...
Gueyoung Jung, Kaustubh R. Joshi, Matti A. Hiltune...
ICCV
2005
IEEE
15 years 3 months ago
KALMANSAC: Robust Filtering by Consensus
We propose an algorithm to perform causal inference of the state of a dynamical model when the measurements are corrupted by outliers. While the optimal (maximumlikelihood) soluti...
Andrea Vedaldi, Hailin Jin, Paolo Favaro, Stefano ...
SC
2000
ACM
15 years 2 months ago
Scalable Algorithms for Adaptive Statistical Designs
We present a scalable, high-performance solution to multidimensional recurrences that arise in adaptive statistical designs. Adaptive designs are an important class of learning al...
Robert H. Oehmke, Janis Hardwick, Quentin F. Stout
ASPDAC
2007
ACM
88views Hardware» more  ASPDAC 2007»
15 years 1 months ago
Voltage Island Generation under Performance Requirement for SoC Designs
Using multiple supply voltages on a SoC design is an efficient way to achieve low power. However, it may lead to a complex power network and a huge number of level shifters if we j...
Wai-Kei Mak, Jr-Wei Chen