Sciweavers

1523 search results - page 93 / 305
» The Computational Complexity of Linear Optics
Sort
View
CDC
2009
IEEE
113views Control Systems» more  CDC 2009»
15 years 8 months ago
Computation of safety control for uncertain piecewise continuous systems on a partial order
— In this paper, the safety control problem for a class of hybrid systems with disturbance inputs and imperfect continuous state information is considered. Under the assumption t...
Michael R. Hafner, Domitilla Del Vecchio
214
Voted
COLT
1992
Springer
15 years 7 months ago
On the Computational Power of Neural Nets
This paper deals with finite size networks which consist of interconnections of synchronously evolving processors. Each processor updates its state by applying a "sigmoidal&q...
Hava T. Siegelmann, Eduardo D. Sontag
SIROCCO
2003
15 years 4 months ago
Polynomial-Time Computable Backup Tables for Shortest-Path Routing
For networks employing shortest-path routing, we introduce a new recovery scheme which needs only one backup routing table. By precomputing this backup table, the network recovers...
Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihi...
120
Voted
CORR
2006
Springer
99views Education» more  CORR 2006»
15 years 3 months ago
An Embedding of the BSS Model of Computation in Light Affine Lambda-Calculus
This paper brings together two lines of research: implicit characterization of complexity classes by Linear Logic (LL) on the one hand, and computation over an arbitrary ring in t...
Patrick Baillot, Marco Pedicini
117
Voted
ATAL
2004
Springer
15 years 9 months ago
Fitting and Compilation of Multiagent Models through Piecewise Linear Functions
Decision-theoretic models have become increasingly popular as a basis for solving agent and multiagent problems, due to their ability to quantify the complex uncertainty and prefe...
David V. Pynadath, Stacy Marsella