5802 search results - page 886 / 1161 » Parallelizing Feature Selection |
184
click to vote
LCPC
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. In this paper, we describe transformation recipes, which provide a high-level interface to the code transformation and code generation capability of a compiler. These rec...
164
Voted
EUROPAR
2001
Springer
15 years 11 months ago
2001
Springer
Distributed-system observation tools require an efficient data structure to store and query the partial-order of execution. Such data structures typically use vector timestamps to...
144
click to vote
MICRO
1999
IEEE
15 years 11 months ago
1999
IEEE
Since there is generally insufficient instruction level parallelism within a single basic block, higher performance is achieved by speculatively scheduling operations in superbloc...
162
click to vote
SAC
1998
ACM
15 years 11 months ago
1998
ACM
The fast messy genetic algorithm (fmGA) belongs to a class of algorithms inspired by the principles of evolution, known appropriately as "evolutionary algorithms" (EAs)....
139
click to vote
CASES
2007
ACM
15 years 10 months ago
2007
ACM
This paper tackles the problem of providing correct information about program variable values in a software-pipelined loop through a non-transparent debugging approach. Since mode...