Sciweavers

4131 search results - page 185 / 827
» Compactness in Topology and Computation
Sort
View
IJBC
2007
86views more  IJBC 2007»
15 years 6 months ago
Optimization and the Miranda Approach in Detecting Horseshoe-Type Chaos by Computer
f of the underlying abstract theorem avoids of referring to any results of applied algebraic topology and relies only on the Brouwer fixed point theorem. The second novelty is tha...
Balázs Bánhelyi, Tibor Csendes, Barn...
ENTCS
2008
91views more  ENTCS 2008»
15 years 6 months ago
Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra
Several different uses of Newton's method in connection with the Fundamental Theorem of Algebra are pointed out. Theoretical subdivision schemes have been combined with the n...
Prashant Batra
ICNP
2009
IEEE
16 years 1 months ago
Scalable IP Lookups using Shape Graphs
—Recently, there has been much renewed interest in developing compact data structures for packet processing functions such as longest prefix-match for IP lookups. This has been ...
Haoyu Song, Murali S. Kodialam, Fang Hao, T. V. La...
ESANN
2007
15 years 8 months ago
Structured reservoir computing with spatiotemporal chaotic attractors
Abstract. We approach the themes “computing with chaos” and “reservoir computing” in a unified setting. Different neural architectures are mentioned which display chaotic...
Carlos Lourenço
EUROPAR
2005
Springer
16 years 5 hour ago
Distributed Maintenance of a Spanning Tree Using Labeled Tree Encoding
Maintaining spanning trees in a distributed fashion is central to many networking applications. In this paper, we propose a self-stabilizing algorithm for maintaining a spanning tr...
Vijay K. Garg, Anurag Agarwal