Sciweavers

1484 search results - page 128 / 297
» Ants meeting algorithms
Sort
View
SIROCCO
2010
14 years 11 months ago
Asynchronous Deterministic Rendezvous in Bounded Terrains
Abstract. Two mobile agents (robots) have to meet in an a priori unknown bounded terrain modeled as a polygon, possibly with polygonal obstacles. Robots are modeled as points, and ...
Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, ...
CISS
2008
IEEE
15 years 4 months ago
Optimizing wireless networks for heterogeneous spatial loads
—Large-scale wireless networks must be designed such that there are no gaps in coverage. It is also desirable to minimize the number of access points used in order to minimize th...
Balaji Rengarajan, Gustavo de Veciana
ASPDAC
2010
ACM
139views Hardware» more  ASPDAC 2010»
14 years 8 months ago
Fixed-outline thermal-aware 3D floorplanning
In this paper, we present a novel algorithm for 3D floorplanning with fixed outline constraints and a particular emphasis on thermal awareness. A computationally efficient thermal ...
Linfu Xiao, Subarna Sinha, Jingyu Xu, Evangeline F...
BMCBI
2010
190views more  BMCBI 2010»
14 years 10 months ago
A parallel and incremental algorithm for efficient unique signature discovery on DNA databases
Background: DNA signatures are distinct short nucleotide sequences that provide valuable information that is used for various purposes, such as the design of Polymerase Chain Reac...
Hsiao Ping Lee, Tzu-Fang Sheu, Chuan Yi Tang
FPGA
2009
ACM
209views FPGA» more  FPGA 2009»
15 years 4 months ago
SPR: an architecture-adaptive CGRA mapping tool
In this paper we present SPR, a new architecture-adaptive mapping tool for use with Coarse-Grained Reconfigurable Architectures (CGRAs). It combines a VLIW style scheduler and FP...
Stephen Friedman, Allan Carroll, Brian Van Essen, ...