Sciweavers

5592 search results - page 214 / 1119
» On Random Betweenness Constraints
Sort
View
JSAC
2007
78views more  JSAC 2007»
15 years 6 months ago
VMesh: Distributed Segment Storage for Peer-to-Peer Interactive Video Streaming
Abstract—Provisioning random access functions in peer-topeer on-demand video streaming is challenging, due to not only the asynchronous user interactivity but also the unpredicta...
Wai-Pun Ken Yiu, Xing Jin, Shueng-Han Gary Chan
CORR
2011
Springer
174views Education» more  CORR 2011»
15 years 1 months ago
Hide-and-Seek with Directional Sensing
: We consider a game played between a hider, who hides a static object in one of several possible positions in a bounded planar region, and a searcher who wishes to reach the objec...
Alessandro Borri, Shaunak Dattaprasad Bopardikar, ...
TIME
2002
IEEE
15 years 11 months ago
Applying Local Search to Temporal Reasoning
Local search techniques have attracted considerable interest in the Artificial Intelligence (AI) community since the development of GSAT [9] and the min-conflicts heuristic [5] ...
John Thornton, Matthew Beaumont, Abdul Sattar, Mic...
ICRA
2000
IEEE
108views Robotics» more  ICRA 2000»
15 years 10 months ago
Deformable Volumes in Path Planning Applications
This paper addresses the problem of path planning for a class of deformable volumes under fairly general manipulation constraints. The underlying geometric model for the volume is...
Elliot Anshelevich, Scott Owens, Florent Lamiraux,...
CONSTRAINTS
2008
138views more  CONSTRAINTS 2008»
15 years 6 months ago
Minimization of Locally Defined Submodular Functions by Optimal Soft Arc Consistency
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
Martin C. Cooper