1312 search results - page 68 / 263 » Formally Optimal Boxing |
IPPS
2000
IEEE
14 years 1 months ago
2000
IEEE
For bulk synchronous computations that have nondeterministic behaviors, dynamic remapping is an effective approach to ensure parallel efficiency. There are two basic issues in re...
ICCAD
1998
IEEE
14 years 1 months ago
1998
IEEE
Retiming and resynthesis transformations can be used for optimizing the area, power, and delay of sequential circuits. Even though this technique has been known for more than a de...
PDSE
1998
13 years 10 months ago
1998
This paper proposes a theoretical framework for verifying and deriving code optimizations for programs written in parallel programming languages. The key idea of this framework is...
ICRA
2010
IEEE
13 years 7 months ago
2010
IEEE
— This paper presents a thorough analysis of the computational complexity of optimal reconfiguration planning problem for chain-type modular robots, i.e. finding the least number...
APLAS
2009
ACM
14 years 3 months ago
2009
ACM
We propose a method for easily developing efficient programs for finding optimal sequences, such as the maximum weighted sequence of a set of feasible ones. We formalize a way to ...