Sciweavers

217 search results - page 35 / 44
» Computational complexity of dynamical systems: The case of c...
Sort
View
TCAD
2008
103views more  TCAD 2008»
13 years 6 months ago
Topology-Based Performance Analysis and Optimization of Latency-Insensitive Systems
Latency-insensitive protocols allow system-on-chip (SoC) engineers to decouple the design of the computing cores from the design of the intercore communication channels while follo...
Rebecca L. Collins, Luca P. Carloni
SAC
2008
ACM
13 years 6 months ago
Supporting self-organization for hybrid grid resource scheduling
Increasing scale, dynamism, and complexity of hybrid grids make traditional grid resource scheduling approaches difficult. In such grids, where resource volatility and dynamism is...
Deger Cenk Erdil, Michael J. Lewis
FSTTCS
2008
Springer
13 years 7 months ago
Banach-Mazur Games on Graphs
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
Erich Grädel
ANCS
2007
ACM
13 years 10 months ago
An improved algorithm to accelerate regular expression evaluation
Modern network intrusion detection systems need to perform regular expression matching at line rate in order to detect the occurrence of critical patterns in packet payloads. Whil...
Michela Becchi, Patrick Crowley
AUTOMATICA
2005
137views more  AUTOMATICA 2005»
13 years 6 months ago
Multivariable frequency-response curve fitting with application to modal parameter estimation
This paper presents a computational approach for the frequency-domain identification of multivariable, discrete-time transfer function models based on a cost function minimization...
P. Verboven, P. Guillaume, B. Cauberghe