Sciweavers

12825 search results - page 2474 / 2565
» Improved PLSOM algorithm
Sort
View
132
Voted
CF
2005
ACM
15 years 4 months ago
Evaluation of extended dictionary-based static code compression schemes
This paper evaluates how much extended dictionary-based code compression techniques can reduce the static code size. In their simplest form, such methods statically identify ident...
Martin Thuresson, Per Stenström
114
Voted
COCO
2005
Springer
130views Algorithms» more  COCO 2005»
15 years 4 months ago
Pseudorandom Bits for Constant Depth Circuits with Few Arbitrary Symmetric Gates
We exhibit an explicitly computable ‘pseudorandom’ generator stretching l bits into m(l) = lΩ(log l) bits that look random to constant-depth circuits of size m(l) with log m...
Emanuele Viola
126
Voted
FORMATS
2008
Springer
15 years 4 months ago
Timed Parity Games: Complexity and Robustness
We consider two-player games played in real time on game structures with clocks and parity objectives. The games are concurrent in that at each turn, both players independently pro...
Krishnendu Chatterjee, Thomas A. Henzinger, Vinaya...
APPROX
2010
Springer
154views Algorithms» more  APPROX 2010»
15 years 4 months ago
The Checkpoint Problem
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...
140
Voted
ISPD
2007
ACM
128views Hardware» more  ISPD 2007»
15 years 4 months ago
X-architecture placement based on effective wire models
In this paper, we derive the X-half-perimeter wirelength (XHPWL) model for X-architecture placement and explore the effects of three different wire models on X-architecture plac...
Tung-Chieh Chen, Yi-Lin Chuang, Yao-Wen Chang
« Prev « First page 2474 / 2565 Last » Next »