Sciweavers

364 search results - page 48 / 73
» Generalized normal forms and polynomial system solving
Sort
View
FPL
2008
Springer
111views Hardware» more  FPL 2008»
14 years 11 months ago
Hyperreconfigurable architectures
Dynamically reconfigurable architectures or systems are able to reconfigure their function and/or structure to suit the changing needs of a computation during run time. The increa...
Sebastian Lange, Martin Middendorf
QUESTA
1998
93views more  QUESTA 1998»
14 years 9 months ago
An approximation method for complete solutions of Markov-modulated fluid models
This paper presents an approximation method for numerically solving general Markov modulated fluid models which are widely used in modelling communications and computer systems. ...
David D. McDonald, Kun Qian
CONCUR
2009
Springer
15 years 4 months ago
Partially-Commutative Context-Free Processes
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...
Wojciech Czerwinski, Sibylle B. Fröschle, Sla...
CASES
2008
ACM
14 years 11 months ago
Control flow optimization in loops using interval analysis
We present a novel loop transformation technique, particularly well suited for optimizing embedded compilers, where an increase in compilation time is acceptable in exchange for s...
Mohammad Ali Ghodrat, Tony Givargis, Alex Nicolau
BMVC
2001
15 years 2 days ago
A Buyer's Guide to Euclidean Elliptical Cylindrical and Conical Surface Fitting
The ability to construct CAD or other object models from edge and range data has a fundamental meaning in building a recognition and positioning system. While the problem of model...
Petko Faber, Robert B. Fisher