Sciweavers

4218 search results - page 15 / 844
» Complete sets of cooperations
Sort
View
TWC
2008
105views more  TWC 2008»
13 years 7 months ago
Selection Cooperation in Multi-Source Cooperative Networks
In a cooperative network with multiple potential relays and multiple simultaneous transmissions, we present selection cooperation wherein each source pairs with a single "best...
Elzbieta Beres, Raviraj Adve
CP
2005
Springer
14 years 1 months ago
Boosting Distributed Constraint Satisfaction
Abstract Competition and cooperation can boost the performance of a combinatorial search process. Both can be implemented with a portfolio of algorithms which run in parallel, give...
Georg Ringwelski, Youssef Hamadi
IAT
2007
IEEE
14 years 1 months ago
CompAPO: A Complete Version of the APO Algorithm
Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions ...
Tal Grinshpoun, Amnon Meisels
ICRA
2006
IEEE
217views Robotics» more  ICRA 2006»
14 years 1 months ago
Complete Coverage Control for Nonholonomic Mobile Robots in Dynamic Environments
— We study the problem of generating continuous steering control for robots to completely cover a bounded region over a finite time. First, we pack the area by disks of minimum ...
Yi Guo, Mohanakrishnan Balakrishnan
CANDC
2009
ACM
14 years 2 months ago
Predicting successful completion of online collaborative animation projects
Online creative collaboration projects are started every day, but many fail to produce new artifacts of value. In this poster, we address the question of why some of these project...
Kurt Luther, Kevin Ziegler, Kelly E. Caine, Amy Br...