Sciweavers

271 search results - page 5 / 55
» On the Online Unit Clustering Problem
Sort
View
AOR
2007
107views more  AOR 2007»
13 years 8 months ago
Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms
We consider the job shop scheduling problem unit−Jm, where each job is processed once on each of m given machines. Every job consists of a permutation of tasks for all machines....
Juraj Hromkovic, Tobias Mömke, Kathleen Stein...
IROS
2006
IEEE
190views Robotics» more  IROS 2006»
14 years 1 months ago
SwisTrack: A Tracking Tool for Multi-Unit Robotic and Biological Systems
— Tracking of miniature robotic platforms involves major challenges in image recognition and data association. We present our 3-year effort into developing the platform-independe...
Nikolaus Correll, Grégory Sempo, Yuri L&oac...
ISCA
2003
IEEE
93views Hardware» more  ISCA 2003»
14 years 1 months ago
Improving Dynamic Cluster Assignment for Clustered Trace Cache Processors
This work examines dynamic cluster assignment for a clustered trace cache processor (CTCP). Previously proposed cluster assignment techniques run into unique problems as issue wid...
Ravi Bhargava, Lizy Kurian John
SAGA
2009
Springer
14 years 2 months ago
Economical Caching with Stochastic Prices
In the economical caching problem, an online algorithm is given a sequence of prices for a certain commodity. The algorithm has to manage a buffer of fixed capacity over time. We...
Matthias Englert, Berthold Vöcking, Melanie W...
COMPUTER
1998
131views more  COMPUTER 1998»
13 years 7 months ago
Windows NT Clustering Service
ER ABSTRACTIONS ter service uses several abstractions— including resource, resource dependencies, and resource groups—to simplify both the cluster service itself and user-visib...
Rod Gamache, Rob Short, Mike Massa