16257 search results - page 210 / 3252 » D-finiteness: algorithms and applications |
231
click to vote
FOCS
2005
IEEE
16 years 4 days ago
2005
IEEE
At the core of the seminal Graph Minor Theory of Robertson and Seymour is a powerful structural theorem capturing the structure of graphs excluding a fixed minor. This result is ...
184
click to vote
EUROPAR
2005
Springer
16 years 1 days ago
2005
Springer
In large-scale parallel applications a graph coloring is often carried out to schedule computational tasks. In this paper, we describe a new distributedmemory algorithm for doing t...
106
click to vote
GECCO
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. As a preprocessing for genetic algorithms, static reordering helps genetic algorithms effectively create and preserve high-quality schemata, and consequently improves th...
155
click to vote
SPIRE
2000
Springer
15 years 10 months ago
2000
Springer
We present new search algorithms to detect the occurrences of any pattern from a given pattern set in a text, allowing in the occurrences a limited number of spurious text charact...
153
click to vote
PPOPP
1995
ACM
15 years 10 months ago
1995
ACM
Scalable busy-wait synchronization algorithms are essential for achieving good parallel program performance on large scale multiprocessors. Such algorithms include mutual exclusio...