Sciweavers

5592 search results - page 349 / 1119
» On Random Betweenness Constraints
Sort
View
ASIAMS
2007
IEEE
16 years 1 months ago
Solving Shortest Capacitated Path Problem Using a Bi-Objective Heuristic Approach
The shortest capacitated path problem is a well known problem in the networking area, having a wide range of applications. In the shortest capacitated path problem, a traffic flow...
Crina Grosan, Ajith Abraham
ICC
2007
IEEE
157views Communications» more  ICC 2007»
16 years 1 months ago
Secure Aggregation in Sensor Networks Using Neighborhood Watch
Abstract— Many sensor networks (SN) use in-network aggregation to minimize the amount of data transmitted by sensors. Unfortunately, aggregation makes the network more vulnerable...
Paul Rabinovich, Robert Simon
ICRA
2007
IEEE
156views Robotics» more  ICRA 2007»
16 years 29 days ago
Multipartite RRTs for Rapid Replanning in Dynamic Environments
Abstract— The Rapidly-exploring Random Tree (RRT) algorithm has found widespread use in the field of robot motion planning because it provides a single-shot, probabilistically c...
Matthew Zucker, James J. Kuffner, Michael S. Brani...
CP
2007
Springer
16 years 25 days ago
On Universal Restart Strategies for Backtracking Search
Abstract. Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that a technique called randomi...
Huayue Wu, Peter van Beek
IROS
2006
IEEE
152views Robotics» more  IROS 2006»
16 years 20 days ago
Experiments with robust estimation techniques in real-time robot vision
— The goal of this paper is to present an overview of robust estimation techniques with a special focus on robotic vision applications. In this particular context, constraints du...
Ezio Malis, Éric Marchand