Sciweavers

4131 search results - page 84 / 827
» Compactness in Topology and Computation
Sort
View
EH
2003
IEEE
138views Hardware» more  EH 2003»
15 years 11 months ago
Implementing Evolution of FIR-Filters Efficiently in an FPGA
Reconfigurable hardware devices make it possible to change the topology of electronic circuits at runtime. Using reconfigurable devices as a platform for Evolvable hardware (EHW) ...
Knut Arne Vinger, Jim Torresen
APAL
2005
82views more  APAL 2005»
15 years 6 months ago
A descending chain condition for groups definable in o-minimal structures
We prove that if G is a group definable in a saturated o-minimal structure, then G has no infinite descending chain of type-definable subgroups of bounded index. Equivalently, G h...
Alessandro Berarducci, Margarita Otero, Ya'acov Pe...
WDAG
2004
Springer
86views Algorithms» more  WDAG 2004»
15 years 11 months ago
Message-Optimal and Latency-Optimal Termination Detection Algorithms for Arbitrary Topologies
An important problem in distributed systems is to detect termination of a distributed computation. A computation is said to have terminated when all processes have become passive ...
Neeraj Mittal, Subbarayan Venkatesan, Sathya Peri
TON
2010
141views more  TON 2010»
15 years 4 months ago
Weighted spectral distribution for internet topology analysis: theory and applications
Abstract—Comparing graphs to determine the level of underlying structural similarity between them is a widely encountered problem in computer science. It is particularly relevant...
Damien Fay, Hamed Haddadi, Andrew Thomason, Andrew...