Sciweavers

1431 search results - page 250 / 287
» The complexity of random ordered structures
Sort
View
HPDC
2006
IEEE
15 years 3 months ago
Path Grammar Guided Trace Compression and Trace Approximation
Trace-driven simulation is an important technique used in the evaluation of computer architecture innovations. However using it for studying parallel computers and applications is...
Xiaofeng Gao, Allan Snavely, Larry Carter
ISPASS
2006
IEEE
15 years 3 months ago
Simulation sampling with live-points
Current simulation-sampling techniques construct accurate model state for each measurement by continuously warming large microarchitectural structures (e.g., caches and the branch...
Thomas F. Wenisch, Roland E. Wunderlich, Babak Fal...
GECCO
2005
Springer
159views Optimization» more  GECCO 2005»
15 years 3 months ago
Using evolutionary algorithms for the unit testing of object-oriented software
As the paradigm of object orientation becomes more and more important for modern IT development projects, the demand for an automated test case generation to dynamically test obje...
Stefan Wappler, Frank Lammermann
ICALP
2005
Springer
15 years 3 months ago
New Approaches for Virtual Private Network Design
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo...
APPROX
2010
Springer
168views Algorithms» more  APPROX 2010»
14 years 11 months ago
Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...
Arnab Bhattacharyya, Elena Grigorescu, Madhav Jha,...