Sciweavers

594 search results - page 58 / 119
» Heuristic Measures of Interestingness
Sort
View
ISPAN
1997
IEEE
14 years 28 days ago
A method for estimating optimal unrolling times for nested loops
Loop unrolling is one of the most promising parallelization techniques, because the nature of programs causes most of the processing time to be spent in their loops. Unrolling not...
Akira Koseki, Hideaki Komatsu, Yoshiaki Fukazawa
ICML
1990
IEEE
14 years 24 days ago
Explanations of Empirically Derived Reactive Plans
Given an adequate simulation model of the task environment and payoff function that measures the quality of partially successful plans, competition-based heuristics such as geneti...
Diana F. Gordon, John J. Grefenstette

Publication
207views
14 years 22 days ago
Wave Like an Egyptian — Accelerometer Based Gesture  Recognition for Culture Specific Interactions
The user’s behavior and his interpretation of interactions with others is influenced by his cultural background, which provides a number of heuristics or patterns of behavior and...
Matthias Rehm, Nikolaus Bee and Elisabeth André
ICC
2007
IEEE
150views Communications» more  ICC 2007»
14 years 18 days ago
ACE Spectrum of LDPC Codes and Generalized ACE Design
The construction of good, finite-length, LDPC codes is currently an attractive research area. Reducing attention to the Binary Erasure Channel (BEC), this problem translates into t...
Dejan Vukobratovic, Aleksandar Djurendic, Vojin Se...
GECCO
2006
Springer
135views Optimization» more  GECCO 2006»
14 years 12 days ago
The no free lunch and realistic search algorithms
The No-Free-Lunch theorems (NFLTs) are criticized for being too general to be of any relevance to the real world scenario. This paper investigates, both formally and empirically, ...
Yossi Borenstein, Riccardo Poli