Sciweavers

4934 search results - page 164 / 987
» complexity 2008
Sort
View
SIAMJO
2008
93views more  SIAMJO 2008»
15 years 4 months ago
Smooth Optimization with Approximate Gradient
We show that the optimal complexity of Nesterov's smooth first-order optimization algorithm is preserved when the gradient is only computed up to a small, uniformly bounded er...
Alexandre d'Aspremont
TIME
2008
IEEE
15 years 11 months ago
Temporal Description Logics: A Survey
We survey temporal description logics that are based on standard temporal logics such as LTL and CTL. In particular, we concentrate on the computational complexity of the satisfi...
Carsten Lutz, Frank Wolter, Michael Zakharyaschev
ENTCS
2008
124views more  ENTCS 2008»
15 years 4 months ago
Modular Functional Descriptions
The construction of reactive systems often requires the combination of different individual functionalities, thus leading to a complex overall behavior. To achieve an efficient co...
Bernhard Schätz
DDECS
2008
IEEE
91views Hardware» more  DDECS 2008»
15 years 6 months ago
Diagnosis of Realistic Defects Based on the X-Fault Model
Defects not described by conventional fault models are a challenge for state-of-the-art fault diagnosis techniques. The X-fault model has been introduced recently as a modeling te...
Ilia Polian, Kohei Miyase, Yusuke Nakamura, Seiji ...
POPL
2008
ACM
16 years 4 months ago
Subcubic algorithms for recursive state machines
We show that the reachability problem for recursive state machines (or equivalently, pushdown systems), believed for long to have cubic worst-case complexity, can be solved in sli...
Swarat Chaudhuri