Sciweavers

4117 search results - page 201 / 824
» On the Satisfiability of Complex Constraints
Sort
View
TCSV
2010
15 years 1 months ago
Application-Centric Routing for Video Streaming Over MultiHop Wireless Networks
Abstract--Most existing works on routing for video transmission over multihop wireless networks only focus on how to satisfy the network-oriented quality-of-service (QoS), such as ...
Dalei Wu, Song Ci, Haohong Wang, Aggelos K. Katsag...
SIGCOMM
2012
ACM
13 years 9 months ago
DeTail: reducing the flow completion time tail in datacenter networks
Web applications have now become so sophisticated that rendering a typical page may require hundreds of intra-datacenter flows. At the same time, web sites must meet strict page ...
David Zats, Tathagata Das, Prashanth Mohan, Dhruba...
SWAT
1998
Springer
84views Algorithms» more  SWAT 1998»
15 years 10 months ago
Models and Motion Planning
We study the complexity of the motion planning problem for a bounded-reach robot in the situation where the n obstacles in its workspace satisfy two of the realistic models propos...
Mark de Berg, Matthew J. Katz, Mark H. Overmars, A...
IPL
2008
78views more  IPL 2008»
15 years 6 months ago
Resource-bounded measure on probabilistic classes
We extend Lutz's resource-bounded measure to probabilistic classes, and obtain notions of resource-bounded measure on probabilistic complexity classes such as BPE and BPEXP. ...
Philippe Moser
CP
2004
Springer
15 years 12 months ago
Leveraging the Learning Power of Examples in Automated Constraint Acquisition
Constraint programming is rapidly becoming the technology of choice for modeling and solving complex combinatorial problems. However, users of constraint programming technology nee...
Christian Bessière, Remi Coletta, Eugene C....