Sciweavers

2711 search results - page 470 / 543
» Convergence of the Wake-Sleep Algorithm
Sort
View
AUTOMATICA
2006
111views more  AUTOMATICA 2006»
14 years 10 months ago
The minimal disturbance invariant set: Outer approximations via its partial sums
This paper is concerned with outer approximations of the minimal disturbance invariant set (MDIS) of a discrete-time linear system with an additive set-bounded disturbance. The k-...
Chong Jin Ong, Elmer G. Gilbert
IJON
2008
177views more  IJON 2008»
14 years 10 months ago
An asynchronous recurrent linear threshold network approach to solving the traveling salesman problem
In this paper, an approach to solving the classical Traveling Salesman Problem (TSP) using a recurrent network of linear threshold (LT) neurons is proposed. It maps the classical ...
Eu Jin Teoh, Kay Chen Tan, H. J. Tang, Cheng Xiang...
CN
2007
102views more  CN 2007»
14 years 10 months ago
The "Global-ISP" paradigm
We present a new paradigm, called “Global ISP” (G-ISP). Its goal is to solve, or at least alleviate, problems of inter-domain routing, such as slow convergence, and lack of Qo...
Reuven Cohen, Amnon Shochot
ISCI
2006
72views more  ISCI 2006»
14 years 9 months ago
A study of particle swarm optimization particle trajectories
Particle swarm optimization (PSO) has shown to be an efficient, robust and simple optimization algorithm. Most of the PSO studies are empirical, with only a few theoretical analys...
F. Van den Bergh, Andries Petrus Engelbrecht
IVC
2006
133views more  IVC 2006»
14 years 9 months ago
A subspace method for projective reconstruction from multiple images with missing data
In this paper, we consider the problem of projective reconstruction based on the subspace method. Unlike existing subspace methods which require that all the points are visible in...
W. K. Tang, Y. S. Hung