44 search results - page 2 / 9 » Conquering Complexity |
MPC
1995
Springer
14 years 2 days ago
1995
Springer
Abstract. We present a strategy to develop, in a functional setting, correct, e cient and portable Divide-and-Conquer (DC) programs for massively parallel architectures. Starting f...
IEEEPACT
2005
IEEE
14 years 2 months ago
2005
IEEE
The continual demand for greater performance and growing concerns about the power consumption in highperformance microprocessors make the branch predictor a critical component of ...
BPM
2009
Springer
14 years 3 months ago
2009
Springer
The goal of Process Mining is to extract process models from logs of a system. Among the possible models to represent a process, Petri nets is an ideal candidate due to its graphic...
AAAI
2000
13 years 10 months ago
2000
We present a new algorithm that reduces the space complexity of heuristic search. It is most effective for problem spaces that grow polynomially with problem size, but contain lar...
CASC
2011
Springer
12 years 8 months ago
2011
Springer
We investigate two practical divide-and-conquer style algorithms for univariate polynomial arithmetic. First we revisit an algorithm originally described by Brent and Kung for comp...