Sciweavers

11328 search results - page 31 / 2266
» Timed Branching Processes
Sort
View
FCCM
2008
IEEE
112views VLSI» more  FCCM 2008»
15 years 8 months ago
Power-Aware and Branch-Aware Word-Length Optimization
Power reduction is becoming more important as circuit size increases. This paper presents a tool called PowerCutter which employs accuracy-guaranteed word-length optimization to r...
William G. Osborne, José Gabriel F. Coutinh...
ATMOS
2010
308views Optimization» more  ATMOS 2010»
15 years 26 days ago
The Team Orienteering Problem: Formulations and Branch-Cut and Price
The Team Orienteering Problem is a routing problem on a graph with durations associated to the arcs and profits assigned to visiting the vertices. A fixed number of identical ve...
Marcus Poggi de Aragão, Henrique Viana, Edu...
ISCA
2005
IEEE
118views Hardware» more  ISCA 2005»
15 years 7 months ago
Continuous Optimization
This paper presents a hardware-based dynamic optimizer that continuously optimizes an application’s instruction stream. In continuous optimization, dataflow optimizations are p...
Brian Fahs, Todd M. Rafacz, Sanjay J. Patel, Steve...
ICTAI
2003
IEEE
15 years 7 months ago
Eliminating Redundancies in SAT Search Trees
Conflict analysis is a powerful paradigm of backtrack search algorithms, in particular for solving satisfiability problems arising from practical applications. Accordingly, most...
Richard Ostrowski, Bertrand Mazure, Lakhdar Sais, ...
AAAI
1998
15 years 3 months ago
Highest Utility First Search Across Multiple Levels of Stochastic Design
Manydesign problems are solved using multiple levels of abstraction, wherea design at one level has combinatorially manychildren at the next level. A stochastic optimization metho...
Louis I. Steinberg, J. Storrs Hall, Brian D. Davis...