Sciweavers

672 search results - page 10 / 135
» Almost Optimal Dispersers
Sort
View
JCT
2006
46views more  JCT 2006»
13 years 9 months ago
Optimal tristance anticodes in certain graphs
For z1, z2, z3 Zn, the tristance d3(z1, z2, z3) is a generalization of the L1-distance on Zn to a quantity that reflects the relative dispersion of three points rather than two. ...
Tuvi Etzion, Moshe Schwartz, Alexander Vardy
ISAAC
2003
Springer
125views Algorithms» more  ISAAC 2003»
14 years 3 months ago
A Heuristic for the Stacker Crane Problem on Trees Which Is Almost Surely Exact
Abstract Given an edge-weighted transportation network G and a list of transportation requests L, the Stacker Crane Problem is to find a minimum-cost tour for a server along the e...
Amin Coja-Oghlan, Sven Oliver Krumke, Till Nierhof...
PE
2008
Springer
89views Optimization» more  PE 2008»
13 years 9 months ago
Merging and splitting autocorrelated arrival processes and impact on queueing performance
We have proposed a three-parameter renewal approximation to analyze splitting and superposition of autocorrelated processes. We define the index of dispersion for counts of an ord...
Baris Balcioglu, David L. Jagerman, Tayfur Altiok
ISPD
2004
ACM
189views Hardware» more  ISPD 2004»
14 years 3 months ago
Almost optimum placement legalization by minimum cost flow and dynamic programming
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
Ulrich Brenner, Anna Pauli, Jens Vygen
ADBIS
2000
Springer
79views Database» more  ADBIS 2000»
14 years 2 months ago
Distributed Searching of k-Dimensional Data with Almost Constant Costs
Abstract. In this paper we consider the dictionary problem in the scalable distributed data structure paradigm introduced by Litwin, Neimat and Schneider and analyze costs for inse...
Adriano Di Pasquale, Enrico Nardelli