Sciweavers

247 search results - page 15 / 50
» Two Size Measures for Timed Languages
Sort
View
ICALP
2003
Springer
14 years 21 days ago
Sophistication Revisited
Kolmogorov complexity measures the ammount of information in a string as the size of the shortest program that computes the string. The Kolmogorov structure function divides the s...
Luis Antunes 0002, Lance Fortnow
DNA
2009
Springer
173views Bioinformatics» more  DNA 2009»
14 years 2 months ago
Time-Complexity of Multilayered DNA Strand Displacement Circuits
Recently we have shown how molecular logic circuits with many components arranged in multiple layers can be built using DNA strand displacement reactions. The potential application...
Georg Seelig, David Soloveichik
CONEXT
2006
ACM
14 years 1 months ago
Modeling ping times in first person shooter games
In First Person Shooter (FPS) games the Round Trip Time (RTT), i.e., the sum of the network delay from client to server and the network delay from server to client, impacts the ga...
Natalie Degrande, Danny De Vleeschauwer, Robert E....
ICCAD
2006
IEEE
147views Hardware» more  ICCAD 2006»
14 years 4 months ago
Analysis and modeling of CD variation for statistical static timing
Statistical static timing analysis (SSTA) has become a key method for analyzing the effect of process variation in aggressively scaled CMOS technologies. Much research has focused...
Brian Cline, Kaviraj Chopra, David Blaauw, Yu Cao
ESOP
2004
Springer
14 years 27 days ago
From Constraints to Finite Automata to Filtering Algorithms
Abstract. We introduce an approach to designing filtering algorithms by derivation from finite automata operating on constraint signatures. We illustrate this approach in two cas...
Mats Carlsson, Nicolas Beldiceanu