Sciweavers

2566 search results - page 47 / 514
» The Online Median Problem
Sort
View
ICONIP
2009
13 years 8 months ago
A Markov Model for Multiagent Patrolling in Continuous Time
Abstract. We present a model for the multiagent patrolling problem with continuous-time. An anytime and online algorithm is then described and extended to asynchronous multiagent d...
Jean-Samuel Marier, Camille Besse, Brahim Chaib-dr...
ORL
1998
97views more  ORL 1998»
13 years 10 months ago
Preemptive on-line scheduling for two uniform processors
This paper considers the problem of preemptive on-line scheduling for two uniform processors in which one of the
Jianjun Wen, Donglei Du
ICDE
2010
IEEE
282views Database» more  ICDE 2010»
14 years 10 months ago
Quantile-Based KNN Over Multi-Valued Objects
K Nearest Neighbor search has many applications including data mining, multi-media, image processing, and monitoring moving objects. In this paper, we study the problem of KNN over...
Wenjie Zhang, Xuemin Lin, Muhammad Aamir Cheema, Y...
EOR
2007
79views more  EOR 2007»
13 years 10 months ago
The directional p
An instance of a p-median problem gives n demand points. The objective is to locate p supply points in order to minimize the total distance of the demand points to their nearest s...
Laura E. Jackson, George N. Rouskas, Matthias F. M...
WWW
2008
ACM
14 years 11 months ago
First workshop on targeting and ranking for online advertising
Online advertising is a rapidly growing, multi-billion dollar industry. It has become a significant element of the Web browsing experience. Ad platforms used for ad selection use ...
Ewa Dominowska, Vanja Josifovski