400 search results - page 59 / 80 » Parallel Algorithms with Optimal Speedup for Bounded Treewid... |
GECCO
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. To improve the efficiency of the currently known evolutionary algorithms, we have proposed two complementary efficiency speed-up strategies in our previous research work ...
DAC
2006
ACM
15 years 10 months ago
2006
ACM
For statistical timing and power analysis that are very important problems in the sub-100nm technologies, stochastic analysis of power grids that characterizes the voltage fluctua...
ICALP
2010
Springer
14 years 11 months ago
2010
Springer
We present a new deterministic sorting algorithm that interleaves the partitioning of a sample sort with merging. Sequentially, it sorts n elements in O(n log n) time cache-oblivi...
139
click to vote
PODC
2011
ACM
14 years 10 days ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
103
click to vote
PODS
2003
ACM
15 years 9 months ago
2003
ACM
We consider the view selection problem for XML content based routing: given a network, in which a stream of XML documents is routed and the routing decisions are taken based on re...