Sciweavers

3656 search results - page 134 / 732
» Compact Location Problems
Sort
View
SIGECOM
2010
ACM
170views ECommerce» more  SIGECOM 2010»
15 years 5 months ago
Optimal online assignment with forecasts
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...
Erik Vee, Sergei Vassilvitskii, Jayavel Shanmugasu...
129
Voted
TPDS
2008
161views more  TPDS 2008»
15 years 21 days ago
Distributed Deployment Schemes for Mobile Wireless Sensor Networks to Ensure Multilevel Coverage
One of the key research issues in wireless sensor networks (WSNs) is how to efficiently deploy sensors to cover an area. In this paper, we solve the k-coverage sensor deployment pr...
You-Chiun Wang, Yu-Chee Tseng
EGH
2003
Springer
15 years 6 months ago
Photon mapping on programmable graphics hardware
We present a modified photon mapping algorithm capable of running entirely on GPUs. Our implementation uses breadth-first photon tracing to distribute photons using the GPU. The...
Timothy J. Purcell, Craig Donner, Mike Cammarano, ...
134
Voted
CSR
2007
Springer
15 years 7 months ago
Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen
107
Voted
MP
1998
109views more  MP 1998»
15 years 14 days ago
Rounding algorithms for covering problems
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
Dimitris Bertsimas, Rakesh V. Vohra