Sciweavers

516 search results - page 19 / 104
» Generalizing the Discrete Timed Automaton
Sort
View
MCSS
2007
Springer
13 years 9 months ago
An ISS small gain theorem for general networks
We provide a generalized version of the nonlinear small gain theorem for the case of more than two coupled input-to-state stable (ISS) systems. For this result the interconnection...
Sergey Dashkovskiy, Björn Rüffer, Fabian...
CDC
2010
IEEE
13 years 4 months ago
Stochastic approximation for consensus with general time-varying weight matrices
This paper considers consensus problems with delayed noisy measurements, and stochastic approximation is used to achieve mean square consensus. For stochastic approximation based c...
Minyi Huang
IPPS
2000
IEEE
14 years 2 months ago
A General Parallel Simulated Annealing Library and its Application in Airline Industry
To solve real-world discrete optimization problems approximately metaheuristics such as simulated annealing and other local search methods are commonly used. For large instances o...
Georg Kliewer, Stefan Tschöke
CORR
2002
Springer
91views Education» more  CORR 2002»
13 years 9 months ago
Quantum Random Walks Hit Exponentially Faster
We show that the hitting time of the discrete time quantum random walk on the n-bit hypercube from one corner to its opposite is polynomial in n. This gives the first exponential ...
Julia Kempe
CDC
2008
IEEE
14 years 4 months ago
Suppressing intersample behavior in Iterative Learning Control
— Iterative Learning Control (ILC) is a control strategy to improve the performance of digital batch repetitive processes. Due to its digital implementation, discrete time ILC ap...
Tom Oomen, Jeroen van de Wijdeven, Okko Bosgra