Sciweavers

434 search results - page 77 / 87
» Improved Algorithms for the 2-Vertex Disjoint Paths Problem
Sort
View
103
Voted
CORR
2011
Springer
142views Education» more  CORR 2011»
14 years 1 months ago
Taming Numbers and Durations in the Model Checking Integrated Planning System
The Model Checking Integrated Planning System (MIPS) has shown distinguished performance in the second and third international planning competitions. With its object-oriented fram...
Stefan Edelkamp
JAIR
2008
98views more  JAIR 2008»
14 years 9 months ago
Loosely Coupled Formulations for Automated Planning: An Integer Programming Perspective
We represent planning as a set of loosely coupled network flow problems, where each network corresponds to one of the state variables in the planning domain. The network nodes cor...
Menkes Hector Louis van den Briel, Thomas Vossen, ...
INFOCOM
2003
IEEE
15 years 2 months ago
Optimal Partition of QoS Requirements for Many-to-Many Connections
— We study problems related to supporting multicast connections with Quality of Service (QoS) requirements. We investigate the problem of optimal resource allocation in the conte...
Dean H. Lorenz, Ariel Orda, Danny Raz
CN
2011
176views more  CN 2011»
14 years 1 months ago
Taming the elephants: New TCP slow start
Standard slow start does not work well under large bandwidthdelay product (BDP) networks. We find two causes of this problem in existing three popular operating systems, Linux, F...
Sangtae Ha, Injong Rhee
IROS
2007
IEEE
123views Robotics» more  IROS 2007»
15 years 3 months ago
Learning humanoid reaching tasks in dynamic environments
— A central challenging problem in humanoid robotics is to plan and execute dynamic tasks in dynamic environments. Given that the environment is known, sampling-based online moti...
Xiaoxi Jiang, Marcelo Kallmann