Sciweavers

334 search results - page 25 / 67
» Time representations and mathematical models for process sch...
Sort
View
AAAI
1998
13 years 10 months ago
Structured Representation of Complex Stochastic Systems
This paperconsidersthe problem of representingcomplex systems that evolve stochastically over time. Dynamic Bayesian networks provide a compact representation for stochastic proce...
Nir Friedman, Daphne Koller, Avi Pfeffer
ANOR
2008
123views more  ANOR 2008»
13 years 9 months ago
An approach to predictive-reactive scheduling of parallel machines subject to disruptions
: In this paper, a new predictive-reactive approach to a parallel machine scheduling problem in the presence of uncertain disruptions is presented. The approach developed is based ...
Alejandra Duenas, Dobrila Petrovic
IPL
2008
80views more  IPL 2008»
13 years 9 months ago
A simpler competitive analysis for scheduling equal-length jobs on one machine with restarts
We consider the online problem of scheduling jobs with equal processing times on a single machine. Each job has a release time and a deadline, and the goal is to maximize the numb...
Michael H. Goldwasser, Arundhati Bagchi Misra
RSS
2007
126views Robotics» more  RSS 2007»
13 years 10 months ago
Automatic Scheduling for Parallel Forward Dynamics Computation of Open Kinematic Chains
— Recent progress in the algorithm as well as the processor power have made the dynamics simulation of complex kinematic chains more realistic in various fields such as human mo...
Katsu Yamane, Yoshihiko Nakamura
APPROX
2006
Springer
124views Algorithms» more  APPROX 2006»
14 years 27 days ago
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
Rajiv Gandhi, Julián Mestre