3991 search results - page 182 / 799 » Bounding homogeneous models |
DATE
1998
IEEE
14 years 14 days ago
1998
IEEE
We propose a new approach to RT-level power modeling for combinationalmacros, that does not require simulationbased characterization. A pattern-dependent power model for a macro i...
WOSP
2004
ACM
14 years 1 months ago
2004
ACM
This paper describes how soft performance bounds can be expressed for software systems using stochastic probes over stochastic process algebra models. These stochastic probes are ...
CORR
2002
Springer
13 years 8 months ago
2002
Springer
Abstract. We study algorithms for computing stable models of propositional logic programs and derive estimates on their worst-case performance that are asymptotically better than t...
UC
2005
Springer
14 years 1 months ago
2005
Springer
We present a theoretical model for self-assembling tiles with flexible branches motivated by DNA branched junction molecules. We encode an instance of a “problem” as a pot of ...
IPPS
1997
IEEE
14 years 12 days ago
1997
IEEE
We present a new randomized sorting algorithm on the Bulk-SynchronousParallel (BSP) model. The algorithm improves upon the parallel slack of previous algorithms to achieve optimal...