Sciweavers

230 search results - page 34 / 46
» Constraint Orbital Branching
Sort
View
RTSS
2005
IEEE
14 years 1 months ago
Optimal Task Rate Selection in Fixed Priority Systems
The design phase of any real-time system requires balancing the limited computational resources against the functional requirements and the performance of the application. The opt...
Enrico Bini, Marco Di Natale
MICRO
1993
IEEE
131views Hardware» more  MICRO 1993»
13 years 11 months ago
Superblock formation using static program analysis
Compile-time code transformations which expose instruction-level parallelism (ILP) typically take into account the constraints imposed by all execution scenarios in the program. H...
Richard E. Hank, Scott A. Mahlke, Roger A. Bringma...
ISAAC
1992
Springer
132views Algorithms» more  ISAAC 1992»
13 years 11 months ago
Generalized Assignment Problems
In the multilevel generalized assignment problem (MGAP) agents can perform tasks at more than one efficiency level. Important manufacturing problems, such as lot sizing, can be ea...
Silvano Martello, Paolo Toth
JCC
2006
68views more  JCC 2006»
13 years 7 months ago
Explicit factorization of external coordinates in constrained statistical mechanics models
If a macromolecule is described by curvilinear coordinates or rigid constraints are imposed, the equilibrium probability density that must be sampled in Monte Carlo simulations in...
Pablo Echenique, Iván Calvo
AI
1999
Springer
13 years 7 months ago
Bucket Elimination: A Unifying Framework for Reasoning
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
Rina Dechter