Sciweavers

7006 search results - page 300 / 1402
» Approximation Algorithms
Sort
View
163
Voted
APPROX
2004
Springer
113views Algorithms» more  APPROX 2004»
16 years 12 hour ago
Computationally-Feasible Truthful Auctions for Convex Bundles
In many economic settings, convex figures on the plane are for sale. For example, one might want to sell advertising space on a newspaper page. Selfish agents must be motivated ...
Moshe Babaioff, Liad Blumrosen
VTC
2007
IEEE
16 years 26 days ago
Decision Directed Channel Estimation Employing Projection Approximation Subspace Tracking
— The attainable capacity and integrity of a state-of-the-art broadband multi-carrier communication system is highly sensitive to the accuracy of the information available concer...
Jos Akhtman, Lajos Hanzo
169
Voted
ATAL
2004
Springer
16 years 11 hour ago
Approximate Solutions for Partially Observable Stochastic Games with Common Payoffs
Partially observable decentralized decision making in robot teams is fundamentally different from decision making in fully observable problems. Team members cannot simply apply si...
Rosemary Emery-Montemerlo, Geoffrey J. Gordon, Jef...
DAC
2011
ACM
14 years 6 months ago
Efficient incremental analysis of on-chip power grid via sparse approximation
In this paper, a new sparse approximation technique is proposed for incremental power grid analysis. Our proposed method is motivated by the observation that when a power grid net...
Pei Sun, Xin Li, Ming Yuan Ting
TEC
2002
128views more  TEC 2002»
15 years 6 months ago
A framework for evolutionary optimization with approximate fitness functions
It is not unusual that an approximate model is needed for fitness evaluation in evolutionary computation. In this case, the convergence properties of the evolutionary algorithm are...
Yaochu Jin, Markus Olhofer, Bernhard Sendhoff