4695 search results - page 737 / 939 » Software Clustering Techniques and the Use of Combined Algor... |
190
click to vote
CGO
2004
IEEE
15 years 11 months ago
2004
IEEE
In this paper, we present a technique for reducing the overhead of collecting path profiles in the context of a dynamic optimizer. The key idea to our approach, called Targeted Pa...
206
click to vote
IOPADS
1996
15 years 8 months ago
1996
Many parallel scientific applications need high-performance I/O. Unfortunately, end-to-end parallel-I/O performance has not been able to keep up with substantial improvements in p...
215
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
Ant Colony Optimization (ACO) has been successfully applied to those combinatorial optimization problems which can be translated into a graph exploration. Artificial ants build s...
203
click to vote
AAAI
2007
15 years 9 months ago
2007
Our work links Chinese calligraphy to computer science through an integrated intelligence approach. We first extract strokes of existent calligraphy using a semi-automatic, twoph...
202
click to vote
FLAIRS
2008
15 years 9 months ago
2008
Solving relaxed problems is a commonly used technique in heuristic search to derive heuristic estimates. In heuristic planning, this is usually done by expanding a planning (reach...