6045 search results - page 865 / 1209 » Computable Linearizations of Well-partial-orderings |
195
click to vote
EUROPAR
2004
Springer
16 years 6 days ago
2004
Springer
High scalability in Peer-to-Peer (P2P) systems has been achieved with the emergence of the networks based on Distributed Hash Table (DHT). Most of the DHTs can be regarded as expon...
173
click to vote
EUROPAR
2004
Springer
16 years 6 days ago
2004
Springer
OLAP queries are typically heavy-weight and ad-hoc thus requiring high storage capacity and processing power. In this paper, we address this problem using a database cluster which...
193
Voted
FSTTCS
2004
Springer
16 years 6 days ago
2004
Springer
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
180
click to vote
GD
2004
Springer
16 years 6 days ago
2004
Springer
We use Schnyder woods of 3-connected planar graphs to produce convex straight line drawings on a grid of size (n − 2 − ∆) × (n − 2 − ∆). The parameter ∆ ≥ 0 depen...
181
click to vote
GECCO
2004
Springer
16 years 6 days ago
2004
Springer
Genetic algorithms require relatively large computation time to solve optimization problems, especially in VLSI CAD such as module placement. Therefore, island-based parallel GAs a...