Sciweavers

968 search results - page 49 / 194
» Evaluating Benchmark Subsetting Approaches
Sort
View
AI
2004
Springer
13 years 7 months ago
A selective sampling approach to active feature selection
Feature selection, as a preprocessing step to machine learning, has been very effective in reducing dimensionality, removing irrelevant data, increasing learning accuracy, and imp...
Huan Liu, Hiroshi Motoda, Lei Yu
RV
2010
Springer
172views Hardware» more  RV 2010»
13 years 6 months ago
Recovery Tasks: An Automated Approach to Failure Recovery
Abstract. We present a new approach for developing robust software applications that breaks dependences on the failed parts of an application’s execution to allow the rest of the...
Brian Demsky, Jin Zhou, William Montaz
AUSAI
2004
Springer
14 years 1 months ago
Embedding Memoization to the Semantic Tree Search for Deciding QBFs
Abstract. Quantified Boolean formulas (QBFs) play an important role in artificial intelligence subjects, specially in planning, knowledge representation and reasoning [20]. In th...
Mohammad GhasemZadeh, Volker Klotz, Christoph Mein...
MICRO
1997
IEEE
105views Hardware» more  MICRO 1997»
13 years 12 months ago
The Multicluster Architecture: Reducing Cycle Time Through Partitioning
The multicluster architecture that we introduce offers a decentralized, dynamically-scheduled architecture, in which the register files, dispatch queue, and functional units of t...
Keith I. Farkas, Paul Chow, Norman P. Jouppi, Zvon...
HEURISTICS
2008
136views more  HEURISTICS 2008»
13 years 6 months ago
Enhancing set constraint solvers with lexicographic bounds
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
Andrew Sadler, Carmen Gervet