Sciweavers

212 search results - page 38 / 43
» Competitive Online Approximation of the Optimal Search Ratio
Sort
View
WINE
2007
Springer
132views Economy» more  WINE 2007»
14 years 1 months ago
Adwords Auctions with Decreasing Valuation Bids
The choice of a bidding language is crucial in auction design in order to correctly capture bidder utilities. We propose a new bidding model for the Adwords auctions of search eng...
Gagan Goel, Aranyak Mehta
HEURISTICS
2006
120views more  HEURISTICS 2006»
13 years 7 months ago
A study of ACO capabilities for solving the maximum clique problem
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of ...
Christine Solnon, Serge Fenet
MOBIHOC
2010
ACM
13 years 5 months ago
Near optimal multi-application allocation in shared sensor networks
Recent years have witnessed the emergence of shared sensor networks as integrated infrastructure for multiple applications. It is important to allocate multiple applications in a ...
You Xu, Abusayeed Saifullah, Yixin Chen, Chenyang ...
JMLR
2008
159views more  JMLR 2008»
13 years 7 months ago
Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies
When monitoring spatial phenomena, which can often be modeled as Gaussian processes (GPs), choosing sensor locations is a fundamental task. There are several common strategies to ...
Andreas Krause, Ajit Paul Singh, Carlos Guestrin
JAIR
2008
103views more  JAIR 2008»
13 years 7 months ago
SATzilla: Portfolio-based Algorithm Selection for SAT
It has been widely observed that there is no single "dominant" SAT solver; instead, different solvers perform best on different instances. Rather than following the trad...
Lin Xu, Frank Hutter, Holger H. Hoos, Kevin Leyton...