Sciweavers

593 search results - page 95 / 119
» An approach to benchmarking configuration complexity
Sort
View
VLSID
1996
IEEE
132views VLSI» more  VLSID 1996»
14 years 1 months ago
A study of composition schemes for mixed apply/compose based construction of ROBDDs
Reduced Ordered Binary Decision Diagrams ROBDDs have traditionally been built in a bottom-up fashion. In this scheme, the intermediate peak memory utilization is often larger than...
Amit Narayan, Sunil P. Khatri, Jawahar Jain, Masah...
SAT
2010
Springer
158views Hardware» more  SAT 2010»
14 years 24 days ago
Dynamic Scoring Functions with Variable Expressions: New SLS Methods for Solving SAT
Abstract. We introduce a new conceptual model for representing and designing Stochastic Local Search (SLS) algorithms for the propositional satisfiability problem (SAT). Our model...
Dave A. D. Tompkins, Holger H. Hoos
ICCBR
2007
Springer
14 years 23 days ago
When Similar Problems Don't Have Similar Solutions
The performance of a Case-Based Reasoning system relies on the integrity of its case base but in real life applications the available data used to construct the case base invariabl...
Stewart Massie, Susan Craw, Nirmalie Wiratunga
DATE
2004
IEEE
122views Hardware» more  DATE 2004»
14 years 19 days ago
Phase Coupled Code Generation for DSPs Using a Genetic Algorithm
The growing use of digital signal processors (DSPs) in embedded systems necessitates the use of optimizing compilers supporting special hardware features. Due to the irregular arc...
Markus Lorenz, Peter Marwedel
GECCO
2006
Springer
207views Optimization» more  GECCO 2006»
14 years 17 days ago
Both robust computation and mutation operation in dynamic evolutionary algorithm are based on orthogonal design
A robust dynamic evolutionary algorithm (labeled RODEA), where both the robust calculation and mutation operator are based on an orthogonal design, is proposed in this paper. Prev...
Sanyou Y. Zeng, Rui Wang, Hui Shi, Guang Chen, Hug...