Sciweavers

312 search results - page 32 / 63
» Degree Bounded Network Design with Metric Costs
Sort
View
FSTTCS
2009
Springer
14 years 3 months ago
Iterative Methods in Combinatorial Optimization
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...
R. Ravi
IROS
2007
IEEE
114views Robotics» more  IROS 2007»
14 years 2 months ago
Design and control of a second-generation hyper-redundant mechanism
— We present a refined, second-generation design, construction and integration, of a compact hyper-redundant snakelike robot, called “Woodstock.” This robot has substantial a...
H. Ben Brown, Michael Schwerin, Elie A. Shammas, H...
IWCMC
2006
ACM
14 years 2 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
INFOCOM
2006
IEEE
14 years 2 months ago
Relay Placement for Higher Order Connectivity in Wireless Sensor Networks
Abstract— Sensors typically use wireless transmitters to communicate with each other. However, sensors may be located in a way that they cannot even form a connected network (e.g...
Abhishek Kashyap, Samir Khuller, Mark A. Shayman
ECRTS
2007
IEEE
14 years 3 months ago
On Dominating Set Allocation Policies in Real-Time Wide-Area Distributed Systems
This paper investigates resource allocation policies for achieving real-time content distribution with subsecond delay bounds on the current Internet. Resource allocation in real-...
Chengdu Huang, Tarek F. Abdelzaher, Xue Liu