Sciweavers

3088 search results - page 9 / 618
» Online Passive-Aggressive Algorithms
Sort
View
ICONIP
2009
13 years 5 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
2002
81views more  ORL 2002»
13 years 7 months ago
On-line scheduling of unit time jobs with rejection: minimizing the total completion time
We consider on-line scheduling of unit time jobs on a single machine with job-dependent penalties. The jobs arrive on-line (one by one) and can be either accepted and scheduled, o...
Leah Epstein, John Noga, Gerhard J. Woeginger
MST
2008
157views more  MST 2008»
13 years 7 months ago
Optimal On-Line Algorithms to Minimize Makespan on Two Machines with Resource Augmentation
We study the problem of on-line scheduling on two uniformly related machines where the on-line algorithm has resources different from those of the off-line algorithm. We consider ...
Leah Epstein, Arik Ganot
IJCGA
2010
155views more  IJCGA 2010»
13 years 6 months ago
Competitive Complexity of Mobile Robot on-Line Motion Planning Problems
This paper is concerned with on-line problems where a mobile robot of size D has to achieve a task in an unknown planar environment whose geometry is acquired by the robot during ...
Yoav Gabriely, Elon Rimon
AAIM
2009
Springer
143views Algorithms» more  AAIM 2009»
13 years 5 months ago
Discrete online TSP
In this paper we introduce a discrete version of the online traveling salesman problem (DOLTSP). We represent the metric space using a weighted graph, where the server is allowed t...
Mauro Aprea, Esteban Feuerstein, Gustavo Sadovoy, ...