Sciweavers

4650 search results - page 705 / 930
» Generating and evaluating evaluative arguments
Sort
View
FATES
2006
Springer
15 years 8 months ago
Goldilocks: Efficiently Computing the Happens-Before Relation Using Locksets
We present a new lockset-based algorithm, Goldilocks, for precisely computing the happens-before relation and thereby detecting data-races at runtime. Dynamic race detection algori...
Tayfun Elmas, Shaz Qadeer, Serdar Tasiran
FMICS
2006
Springer
15 years 8 months ago
Test Coverage for Loose Timing Annotations
Abstract. The design flow of systems-on-a-chip (SoCs) identifies several abstraction levels higher than the Register-Transfer-Level that constitutes the input of the synthesis tool...
Claude Helmstetter, Florence Maraninchi, Laurent M...
GECCO
2006
Springer
161views Optimization» more  GECCO 2006»
15 years 8 months ago
The LEM3 implementation of learnable evolution model and its testing on complex function optimization problems
1 Learnable Evolution Model (LEM) is a form of non-Darwinian evolutionary computation that employs machine learning to guide evolutionary processes. Its main novelty are new type o...
Janusz Wojtusiak, Ryszard S. Michalski
EWCBR
2000
Springer
15 years 7 months ago
Maintaining Case-Based Reasoning Systems Using Fuzzy Decision Trees
This paper proposes a methodology of maintaining Case Based Reasoning (CBR) systems by using fuzzy decision tree induction - a machine learning technique. The methodology is mainly...
Simon C. K. Shiu, Cai Hung Sun, Xizhao Wang, Danie...
ICS
2000
Tsinghua U.
15 years 7 months ago
Synthesizing transformations for locality enhancement of imperfectly-nested loop nests
We present an approach for synthesizing transformations to enhance locality in imperfectly-nested loops. The key idea is to embed the iteration space of every statement in a loop ...
Nawaaz Ahmed, Nikolay Mateev, Keshav Pingali