Sciweavers

4378 search results - page 330 / 876
» On the Complexity of Ordered Colourings
Sort
View
TELSYS
2002
73views more  TELSYS 2002»
15 years 6 months ago
Avoiding Counting to Infinity in Distance Vector Routing
The Routing Information Protocol (RIP) may introduce misleading routing information into the routing table, due to network topology changes such as link or router failures. This is...
Andreas Schmid, Christoph Steigner
TON
2002
138views more  TON 2002»
15 years 6 months ago
Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet
Prompted by the advent of quality-of-service routing in the Internet, we investigate the properties that path weight functions must have so that hop-by-hop routing is possible and ...
João L. Sobrinho
VLDB
2002
ACM
156views Database» more  VLDB 2002»
15 years 6 months ago
A Logical Framework for Scheduling Workflows under Resource Allocation Constraints
A workflow consists of a collection of coordinated tasks designed to carry out a welldefined complex process, such as catalog ordering, trip planning, or a business process in an ...
Pinar Senkul, Michael Kifer, Ismail Hakki Toroslu
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...
IVA
2010
Springer
15 years 5 months ago
Interactive Motion Modeling and Parameterization by Direct Demonstration
Abstract. While interactive virtual humans are becoming widely used in education, training and therapeutic applications, building animations which are both realistic and parameteri...
Carlo Camporesi, Yazhou Huang, Marcelo Kallmann