Sciweavers

3204 search results - page 487 / 641
» The b-chromatic Number of a Graph
Sort
View
IJRR
2010
115views more  IJRR 2010»
15 years 3 months ago
Improving the Efficiency of Clearing with Multi-agent Teams
We present an anytime algorithm for coordinating multiple autonomous searchers to find a potentially adversarial target on a graphical representation of a physical environment. Th...
Geoffrey Hollinger, Sanjiv Singh, Athanasios Kehag...
WWW
2011
ACM
15 years 1 months ago
Predicting popular messages in Twitter
Social network services have become a viable source of information for users. In Twitter, information deemed important by the community propagates through retweets. Studying the c...
Liangjie Hong, Ovidiu Dan, Brian D. Davison
ICALP
2011
Springer
14 years 10 months ago
On the Advice Complexity of the k-Server Problem
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
Hans-Joachim Böckenhauer, Dennis Komm, Rastis...
CIE
2011
Springer
14 years 6 months ago
Automatic Learners with Feedback Queries
Automatic classes are classes of languages for which a finite automaton can decide whether a given element is in a set given by its index. The present work studies the learnabilit...
John Case, Sanjay Jain, Yuh Shin Ong, Pavel Semukh...
DCG
2002
106views more  DCG 2002»
15 years 6 months ago
Perpendicular Dissections of Space
For each pair (Qi, Qj) of reference points and each real number r there is a unique hyperplane h QiQj such that d(P, Qi)2 - d(P, Qj)2 = r for points P in h. Take n reference point...
Thomas Zaslavsky