6693 search results - page 911 / 1339 » On an anytime algorithm for control |
130
click to vote
IPPS
1998
IEEE
15 years 8 months ago
1998
IEEE
An effort to formalize the process of software pipelining loops with conditions is presented in this paper. A formal framework for scheduling such loops, based on representing set...
138
click to vote
ICCAD
1997
IEEE
15 years 8 months ago
1997
IEEE
Traditional minimum area retiming algorithms attempt to achieve their prescribed objective with no regard to maintaining the initial state of the system. This issue is important f...
128
Voted
HPDC
1996
IEEE
15 years 8 months ago
1996
IEEE
In this paper a model for scheduling in wide-area systems is described. The model is federated and utilizes a collection of local site schedulers that control the use of their res...
125
Voted
RTAS
1996
IEEE
15 years 8 months ago
1996
IEEE
The proliferation of mobile computers and wireless networks requires the design of future distributed real-time applications to recognize and deal with the signi cant asymmetry be...
103
click to vote
VISUALIZATION
1996
IEEE
15 years 8 months ago
1996
IEEE
This paper presents a novel approach to assist the user in exploring appropriate transfer functions for the visualization of volumetric datasets. The search for a transfer functio...