Sciweavers

1016 search results - page 185 / 204
» Optimized algorithms for multi-agent routing
Sort
View
OL
2011
242views Neural Networks» more  OL 2011»
14 years 4 months ago
On connected domination in unit ball graphs
Given a simple undirected graph, the minimum connected dominating set problem is to find a minimum cardinality subset of vertices D inducing a connected subgraph such that each ve...
Sergiy Butenko, Sera Kahruman-Anderoglu, Oleksii U...
ECRTS
2007
IEEE
15 years 4 months ago
On Scheduling and Real-Time Capacity of Hexagonal Wireless Sensor Networks
Since wireless ad-hoc networks use shared communication medium, accesses to the medium must be coordinated to avoid packet collisions. Transmission scheduling algorithms allocate ...
Shashi Prabh, Tarek F. Abdelzaher
GIS
2006
ACM
15 years 10 months ago
Exploiting a page-level upper bound for multi-type nearest neighbor queries
Given a query point and a collection of spatial features, a multi-type nearest neighbor (MTNN) query finds the shortest tour for the query point such that only one instance of eac...
Xiaobin Ma, Shashi Shekhar, Hui Xiong, Pusheng Zha...
83
Voted
DAC
2005
ACM
14 years 11 months ago
How accurately can we model timing in a placement engine?
This paper presents a novel placement algorithm for timing optimization based on a new and powerful concept, which we term differential timing analysis. Recognizing that accurate ...
Amit Chowdhary, Karthik Rajagopal, Satish Venkates...
IWCMC
2006
ACM
15 years 3 months ago
Modeling key agreement in multi-hop ad hoc networks
Securing multicast communications in ad hoc networks has become one of the most challenging research directions in the areas of wireless networking and security. This is especiall...
Giovanni Di Crescenzo, Maria Striki, John S. Baras