Sciweavers

52 search results - page 5 / 11
» Generalizing Partial Order and Dynamic Backtracking
Sort
View
ICRA
2003
IEEE
154views Robotics» more  ICRA 2003»
15 years 2 months ago
Obstacle avoidance in formation
Abstract— In this paper, we present an approach to obstacle avoidance for a group of unmanned vehicles moving in formation. The goal of the group is to move through a partially u...
Petter Ögren, Naomi Ehrich Leonard
WCFLP
2005
ACM
15 years 2 months ago
Lightweight program specialization via dynamic slicing
Program slicing is a well-known technique that extracts from a program those statements which are relevant to a particular criterion. While static slicing does not consider any in...
Claudio Ochoa, Josep Silva, Germán Vidal
UAI
2003
14 years 10 months ago
On Triangulating Dynamic Graphical Models
This paper introduces improved methodology to triangulate dynamic graphical models and dynamic Bayesian networks (DBNs). In this approach, a standard DBN template can be modified...
Jeff A. Bilmes, Chris Bartels
COMCOM
1998
102views more  COMCOM 1998»
14 years 9 months ago
Preferred link based delay-constrained least-cost routing in wide area networks
Multimedia applications involving digital audio and/or digital video transmissions require strict QoS constraints (end-to-end delay bound, bandwidth availability, packet loss rate...
R. Sriram, Govindarasu Manimaran, C. Siva Ram Murt...
CP
2006
Springer
15 years 1 months ago
Dynamic Symmetry Breaking Restarted
ion of a given partial assignment of values to variables. Compared with other symmetry breaking techniques, the big advantage of dynamic symmetry breaking is that it can accommodat...
Daniel S. Heller, Meinolf Sellmann