Sciweavers

1813 search results - page 82 / 363
» Instance Pruning Techniques
Sort
View
ICCAD
2001
IEEE
86views Hardware» more  ICCAD 2001»
16 years 1 months ago
System-Level Exploration for Pareto-Optimal Configurations in Parameterized Systems-on-a-Chip
In this work, we provide a technique for efficiently exploring the configuration space of a parameterized system-on-a-chip (SOC) architecture to find all Pareto-optimal configurat...
Tony Givargis, Frank Vahid, Jörg Henkel
COMPSAC
2006
IEEE
15 years 10 months ago
Backtracking Algorithms and Search Heuristics to Generate Test Suites for Combinatorial Testing
Combinatorial covering arrays have been used in several testing approaches. This paper first discusses some existing methods for finding such arrays. Then a SAT-based approach a...
Jun Yan, Jian Zhang
WABI
2005
Springer
15 years 10 months ago
Rotamer-Pair Energy Calculations Using a Trie Data Structure
Abstract. Protein design software places amino acid side chains by precomputing rotamer-pair energies and optimizing rotamer placement. If the software optimizes by rapid stochasti...
Andrew Leaver-Fay, Brian Kuhlman, Jack Snoeyink
DAWAK
2000
Springer
15 years 9 months ago
Mining Frequent Binary Expressions
In data mining, searching for frequent patterns is a common basic operation. It forms the basis of many interesting decision support processes. In this paper we present a new type ...
Toon Calders, Jan Paredaens
KDD
1998
ACM
105views Data Mining» more  KDD 1998»
15 years 8 months ago
PlanMine: Sequence Mining for Plan Failures
This paper presents the PLANMINE sequence mining algorithm to extract patterns of events that predict failures in databases of plan executions. New techniques were needed because ...
Mohammed Javeed Zaki, Neal Lesh, Mitsunori Ogihara