Sciweavers

45
Voted
TC
2010
13 years 10 months ago
A Novel Weighted-Graph-Based Grouping Algorithm for Metadata Prefetching
— Although data prefetching algorithms have been extensively studied for years, there is no counterpart research done for metadata access performance. Existing data prefetching a...
Peng Gu, Jun Wang, Yifeng Zhu, Hong Jiang, Pengju ...
TALG
2010
86views more  TALG 2010»
13 years 10 months ago
Approximating corridors and tours via restriction and relaxation techniques
Given a rectangular boundary partitioned into rectangles, the Minimum-Length Corridor (MLC-R) problem consists of finding a corridor of least total length. A corridor is a set of ...
Arturo Gonzalez-Gutierrez, Teofilo F. Gonzalez
TALG
2010
73views more  TALG 2010»
13 years 10 months ago
Discounted deterministic Markov decision processes and discounted all-pairs shortest paths
We present two new algorithms for finding optimal strategies for discounted, infinite-horizon, Deterministic Markov Decision Processes (DMDP). The first one is an adaptation of...
Omid Madani, Mikkel Thorup, Uri Zwick
TACAS
2010
Springer
316views Algorithms» more  TACAS 2010»
13 years 10 months ago
JTorX: A Tool for On-Line Model-Driven Test Derivation and Execution
We introduce JTorX, a tool for model-driven test derivation and execution, based on the ioco theory. This theory, originally presented in [12], has been refined in [13] with test-...
Axel Belinfante
SWAT
2010
Springer
203views Algorithms» more  SWAT 2010»
13 years 10 months ago
The MST of Symmetric Disk Graphs Is Light
A. Karim Abu-Affash, Rom Aschner, Paz Carmi, Matth...
SWAT
2010
Springer
207views Algorithms» more  SWAT 2010»
13 years 10 months ago
Dispatching Equal-Length Jobs to Parallel Machines to Maximize Throughput
David P. Bunde, Michael H. Goldwasser
SWAT
2010
Springer
242views Algorithms» more  SWAT 2010»
13 years 10 months ago
Minimizing the Diameter of a Network Using Shortcut Edges
We study the problem of minimizing the diameter of a graph by adding k shortcut edges, for speeding up communication in an existing network design. We develop constant-factor appro...
Erik D. Demaine, Morteza Zadimoghaddam
SWARM
2010
SPRINGER
420views Optimization» more  SWARM 2010»
13 years 10 months ago
Fireworks Algorithm for Optimization
Abstract. Inspired by observing fireworks explosion, a novel swarm intelligence algorithm, called Fireworks Algorithm (FA), is proposed for global optimization of complex function...
Ying Tan, Yuanchun Zhu
STOC
2010
ACM
186views Algorithms» more  STOC 2010»
13 years 10 months ago
Detecting high log-densities: an O(n1/4) approximation for densest k-subgraph
Aditya Bhaskara, Moses Charikar, Eden Chlamtac, Ur...
STOC
2010
ACM
238views Algorithms» more  STOC 2010»
13 years 10 months ago
Almost tight bounds for rumour spreading with conductance
Flavio Chierichetti, Silvio Lattanzi, Alessandro P...