Sciweavers

1957 search results - page 87 / 392
» Approximate algorithms for neural-Bayesian approaches
Sort
View
SIGECOM
2009
ACM
108views ECommerce» more  SIGECOM 2009»
15 years 4 months ago
Selling ad campaigns: online algorithms with cancellations
We study online pricing problems in markets with cancellations, i.e., markets in which prior allocation decisions can be revoked, but at a cost. In our model, a seller receives re...
Moshe Babaioff, Jason D. Hartline, Robert D. Klein...
GECCO
2008
Springer
186views Optimization» more  GECCO 2008»
14 years 11 months ago
A pareto following variation operator for fast-converging multiobjective evolutionary algorithms
One of the major difficulties when applying Multiobjective Evolutionary Algorithms (MOEA) to real world problems is the large number of objective function evaluations. Approximate...
A. K. M. Khaled Ahsan Talukder, Michael Kirley, Ra...
SENSYS
2003
ACM
15 years 3 months ago
Minimal and maximal exposure path algorithms for wireless embedded sensor networks
Sensor networks not only have the potential to change the way we use, interact with, and view computers, but also the way we use, interact with, and view the world around us. In o...
Giacomino Veltri, Qingfeng Huang, Gang Qu, Miodrag...
CCIA
2005
Springer
15 years 3 months ago
Direct Policy Search Reinforcement Learning for Robot Control
— This paper proposes a high-level Reinforcement Learning (RL) control system for solving the action selection problem of an autonomous robot. Although the dominant approach, whe...
Andres El-Fakdi, Marc Carreras, Narcís Palo...
IJSNET
2008
125views more  IJSNET 2008»
14 years 9 months ago
Minimum-cost sensor arrangement for achieving wanted coverage lifetime
: Suppose we need to watch a set of targets continuously for a required period of time, and suppose we choose any number of sensors from a fixed set of sensor types and place them ...
Jie Wang, Ning Zhong