Sciweavers

936 search results - page 152 / 188
» Task Graph Scheduling Using Timed Automata
Sort
View
RTAS
2005
IEEE
15 years 5 months ago
Improving WCET by Optimizing Worst-Case Paths
It is advantageous to perform compiler optimizations to lower the WCET of a task since tasks with lower WCETs are easier to schedule and more likely to meet their deadlines. Compi...
Wankang Zhao, William C. Kreahling, David B. Whall...
PAMI
2010
103views more  PAMI 2010»
14 years 10 months ago
The Sum-over-Paths Covariance Kernel: A Novel Covariance Measure between Nodes of a Directed Graph
—This work introduces a link-based covariance measure between the nodes of a weighted directed graph where a cost is associated to each arc. To this end, a probability distributi...
Amin Mantrach, Luh Yen, Jérôme Callut...
EXPERT
2002
129views more  EXPERT 2002»
14 years 11 months ago
Modeling and Simulating Work Practice: A Method for Work Systems Design
er than abstracting human behavior as work processes or tasks--functional idealizations of the work to be accomplished--we model people's activities comprehensively and chrono...
Maarten Sierhuis, William J. Clancey
ITNG
2010
IEEE
15 years 4 months ago
Applying Semantic Web Techniques to Reservoir Engineering: Challenges and Experiences from Event Modeling
—In reservoir engineering domain experts deal with many tasks and operations, ranging from reservoir simulation to well maintenance scheduling, with the goal of maximizing oil pr...
Tao Zhu, Amol Bakshi, Viktor K. Prasanna, Karthik ...
ORL
1998
68views more  ORL 1998»
14 years 11 months ago
A fast bipartite network flow algorithm for selective assembly
Bipartite network flow problems naturally arise in applications such as selective assembly and preemptive scheduling. This paper presents fast algorithms for these problems that ...
Satoru Iwata, Tomomi Matsui, S. Thomas McCormick