Sciweavers

19700 search results - page 130 / 3940
» DNA-Based Computation Times
Sort
View
TNN
2010
174views Management» more  TNN 2010»
14 years 7 months ago
Equivalences between neural-autoregressive time series models and fuzzy systems
Soft computing (SC) emerged as an integrating framework for a number of techniques that could complement one another quite well (artificial neural networks, fuzzy systems, evolutio...
José Luis Aznarte, José Manuel Ben&i...
93
Voted
DATE
2002
IEEE
122views Hardware» more  DATE 2002»
15 years 5 months ago
Exploiting Idle Cycles for Algorithm Level Re-Computing
Although algorithm level re-computing techniques can trade-off the detection capability of Concurrent Error Detection (CED) vs. time overhead, it results in 100% time overhead whe...
Kaijie Wu, Ramesh Karri
94
Voted
CORR
2010
Springer
156views Education» more  CORR 2010»
14 years 11 months ago
Scheduling Periodic Real-Time Tasks with Heterogeneous Reward Requirements
—We study the problem of scheduling periodic real-time tasks which have individual minimum reward requirements. We consider situations where tasks generate jobs that can be provi...
I-Hong Hou, P. R. Kumar
PAMI
2010
112views more  PAMI 2010»
14 years 11 months ago
Polynomial Time Algorithms for Ratio Regions and a Variant of Normalized Cut
—In partitioning, clustering, and grouping problems, a typical goal is to group together similar objects, or pixels in the case of image processing. At the same time, another goa...
Dorit S. Hochbaum
115
Voted
QEST
2010
IEEE
14 years 10 months ago
Fortuna: Model Checking Priced Probabilistic Timed Automata
We introduce Fortuna, the first tool for model checking priced probabilistic timed automata (PPTAs). Fortuna can handle the combination of real-time, probabilistic and cost feature...
Jasper Berendsen, David N. Jansen, Frits W. Vaandr...