Sciweavers

7006 search results - page 521 / 1402
» Approximation Algorithms
Sort
View
PKDD
2009
Springer
184views Data Mining» more  PKDD 2009»
15 years 11 months ago
Boosting Active Learning to Optimality: A Tractable Monte-Carlo, Billiard-Based Algorithm
Abstract. This paper focuses on Active Learning with a limited number of queries; in application domains such as Numerical Engineering, the size of the training set might be limite...
Philippe Rolet, Michèle Sebag, Olivier Teyt...
CORR
2008
Springer
83views Education» more  CORR 2008»
15 years 6 months ago
Resource Allocation in Multiple Access Channels
We consider the problem of rate allocation in a Gaussian multiple-access channel, with the goal of maximizing a utility function over transmission rates. In contrast to the literat...
Ali ParandehGheibi, Atilla Eryilmaz, Asuman E. Ozd...
SODA
2010
ACM
148views Algorithms» more  SODA 2010»
16 years 3 months ago
Limits on the Social Welfare of Maximal-In-Range Auction Mechanisms
Many commonly-used auction mechanisms are "maximal-in-range". We show that any maximalin-range mechanism for n bidders and m items cannot both approximate the social wel...
Dave Buchfuhrer, Chris Umans
HIPC
2004
Springer
15 years 12 months ago
Parallel Performance of Hierarchical Multipole Algorithms for Inductance Extraction
Parasitic extraction techniques are used to estimate signal delay in VLSI chips. Inductance extraction is a critical component of the parasitic extraction process in which on-chip ...
Hemant Mahawar, Vivek Sarin, Ananth Grama
GECCO
2007
Springer
558views Optimization» more  GECCO 2007»
16 years 19 days ago
A chain-model genetic algorithm for Bayesian network structure learning
Bayesian Networks are today used in various fields and domains due to their inherent ability to deal with uncertainty. Learning Bayesian Networks, however is an NP-Hard task [7]....
Ratiba Kabli, Frank Herrmann, John McCall