Sciweavers

4229 search results - page 674 / 846
» On the Optimality of Spiral Search
Sort
View
NETWORKS
2007
15 years 6 months ago
Vertex disjoint routings of cycles over tori
We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consi...
Jean-Claude Bermond, Min-Li Yu
PR
2007
184views more  PR 2007»
15 years 6 months ago
Shape retrieval using triangle-area representation and dynamic space warping
We present a shape representation and a matching method for nonrigid shapes with closed contours. The representation utilizes the areas of the triangles formed by the boundary poi...
Naif Alajlan, Ibrahim El Rube, Mohamed S. Kamel, G...
ICRA
2010
IEEE
154views Robotics» more  ICRA 2010»
15 years 5 months ago
Multi-agent path planning with multiple tasks and distance constraints
— The DPC algorithm developed in our previous work is an efficient way of computing optimal trajectories for multiple robots in a distributed fashion with timeparameterized cons...
Subhrajit Bhattacharya, Maxim Likhachev, Vijay Kum...
INFOCOM
2010
IEEE
15 years 5 months ago
Joint Random Access and Power Selection for Maximal Throughput in Wireless Networks
—In wireless networks, how to select transmit power that maximizes throughput is a challenging problem. On one hand, transmissions at a high power level could increase interferen...
Yan Gao, Zheng Zeng, P. R. Kumar
TRANSCI
2008
94views more  TRANSCI 2008»
15 years 5 months ago
Routing for Relief Efforts
In the aftermath of a large disaster, the routing of vehicles carrying critical supplies can greatly impact the arrival times to those in need. Since it is critical that the deliv...
Ann Melissa Campbell, Dieter Vandenbussche, Willia...