Sciweavers

392 search results - page 20 / 79
» Maximal Completion
Sort
View
JPDC
2007
92views more  JPDC 2007»
13 years 8 months ago
Dynamically mapping tasks with priorities and multiple deadlines in a heterogeneous environment
In a distributed heterogeneous computing system, the resources have different capabilities and tasks have different requirements. To maximize the performance of the system, it is ...
Jong-Kook Kim, Sameer Shivle, Howard Jay Siegel, A...
TACAS
1995
Springer
94views Algorithms» more  TACAS 1995»
14 years 15 days ago
A User Guide to HyTech
HyTech is a tool for the automated analysis of embedded systems. This document, designed for the rst-time user of HyTech, guides the reader through the underlying system model, an...
Thomas A. Henzinger, Pei-Hsin Ho, Howard Wong-Toi
RTCSA
2005
IEEE
14 years 2 months ago
Approximation Algorithms for Scheduling Multiple Feasible Interval Jobs
Abstract— Time-critical jobs in many real-time applications have multiple feasible intervals. Such a job is constrained to execute from start to completion in one of its feasible...
Jian-Jia Chen, Jun Wu, Chi-Sheng Shih, Tei-Wei Kuo
DAGM
2007
Springer
14 years 3 months ago
A Fast and Reliable Coin Recognition System
This paper presents a reliable coin recognition system that is based on a registration approach. To optimally align two coins we search for a rotation in order to reach a maximal n...
Marco Reisert, Olaf Ronneberger, Hans Burkhardt
COCOON
2009
Springer
14 years 3 months ago
Graph-Based Data Clustering with Overlaps
We introduce overlap cluster graph modification problems where, other than in most previous work, the clusters of the target graph may overlap. More precisely, the studied graph p...
Michael R. Fellows, Jiong Guo, Christian Komusiewi...