Sciweavers

395 search results - page 4 / 79
» Determining the Idle Time of a Tiling: New Results
Sort
View
WSC
2004
13 years 9 months ago
A New Method to Determine the Tool Count of a Semiconductor Factory Using FabSim
Tool count optimization is mandatory for an efficiently organized semiconductor factory. This paper describes an efficient heuristic to determine the tool count using the compact ...
Holger Vogt
ASIACRYPT
2006
Springer
13 years 11 months ago
New Guess-and-Determine Attack on the Self-Shrinking Generator
We propose a new type of guess-and-determine attack on the self-shrinking generator (SSG). The inherent flexibility of the new attack enables us to deal with different attack condi...
Bin Zhang, Dengguo Feng
STOC
2001
ACM
115views Algorithms» more  STOC 2001»
14 years 8 months ago
Running time and program size for self-assembled squares
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-De...
COMBINATORICS
2002
82views more  COMBINATORICS 2002»
13 years 7 months ago
Non-Repetitive Tilings
In 1906 Axel Thue showed how to construct an infinite non-repetitive (or squarefree) word on an alphabet of size 3. Since then this result has been rediscovered many times and ext...
James D. Currie, Jamie Simpson
ICPP
2007
IEEE
14 years 1 months ago
Real-Time Divisible Load Scheduling with Different Processor Available Times
Providing QoS and performance guarantees to arbitrarily divisible loads has become a significant problem for many cluster-based research computing facilities. While progress is b...
Xuan Lin, Ying Lu, Jitender S. Deogun, Steve Godda...