2899 search results - page 37 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
178
click to vote
SC
2000
ACM
15 years 10 months ago
2000
ACM
This paper proposes a hardware mechanism for reducing coherency overhead occurring in scientific computations within DSM systems. A first phase aims at detecting, in the address s...
180
click to vote
WSC
2008
15 years 8 months ago
2008
In an assembly line with high labor proportion, the workforce planning and scheduling is a very complex problem. At the background of increasing labor costs, it is very important ...
179
click to vote
ICALP
2000
Springer
15 years 10 months ago
2000
Springer
We establish that the algorithmic complexity of the minimum spanning tree problem is equal to its decision-tree complexity. Specifically, we present a deterministic algorithm to fi...
177
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
: We propose a new algorithm to the problem of polygonal curve approximation based on a multiresolution approach. This algorithm is suboptimal but still maintains some optimality b...
154
click to vote
PATMOS
2004
Springer
15 years 12 months ago
2004
Springer
We present SoftExplorer, a tool to estimate and analyze the power and energy consumption of an algorithm from the C program. The consumption of every loop is analyzed, and the inï¬...