Sciweavers

517 search results - page 57 / 104
» Approximation Algorithms for Scheduling with Reservations
Sort
View
NIPS
1998
14 years 11 months ago
SMEM Algorithm for Mixture Models
When learning a mixture model, we suffer from the local optima and model structure determination problems. In this paper, we present a method for simultaneously solving these prob...
Naonori Ueda, Ryohei Nakano, Zoubin Ghahramani, Ge...
COMGEO
2007
ACM
14 years 10 months ago
A package for exact kinetic data structures and sweepline algorithms
In this paper we present a package for implementing exact kinetic data structures built on objects which move along polynomial trajectories. We discuss how the package design was ...
Daniel Russel, Menelaos I. Karavelas, Leonidas J. ...
INFOCOM
2012
IEEE
13 years 13 days ago
Constant-approximation for target coverage problem in wireless sensor networks
—When a large amount of sensors are randomly deployed into a field, how can we make a sleep/activate schedule for sensors to maximize the lifetime of target coverage in the fie...
Ling Ding, Weili Wu, James Willson, Lidong Wu, Zai...
ATAL
2009
Springer
15 years 4 months ago
Decentralised dynamic task allocation: a practical game: theoretic approach
This paper reports on a novel decentralised technique for planning agent schedules in dynamic task allocation problems. Specifically, we use a Markov game formulation of these pr...
Archie C. Chapman, Rosa Anna Micillo, Ramachandra ...
SAC
2010
ACM
14 years 11 months ago
Energy-efficient scheduling on homogeneous multiprocessor platforms
Low-power and energy-efficient system implementations have become very important design issues to extend operation duration or cut power bills. To balance the energy consumption r...
Jian-Jia Chen, Lothar Thiele