Sciweavers

559 search results - page 86 / 112
» Fast SDP Algorithms for Constraint Satisfaction Problems
Sort
View
AAAI
2007
13 years 11 months ago
Nonmyopic Informative Path Planning in Spatio-Temporal Models
In many sensing applications we must continuously gather information to provide a good estimate of the state of the environment at every point in time. A robot may tour an environ...
Alexandra Meliou, Andreas Krause, Carlos Guestrin,...
PODC
2009
ACM
14 years 9 months ago
Fast distributed random walks
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
Atish Das Sarma, Danupon Nanongkai, Gopal Panduran...
JMMA
2010
90views more  JMMA 2010»
13 years 3 months ago
A Unified Approach to Algorithms Generating Unrestricted and Restricted Integer Compositions and Integer Partitions
An original algorithm is presented that generates both restricted integer compositions and restricted integer partitions that can be constrained simultaneously by a) upper and low...
John Douglas Opdyke
DSS
2008
127views more  DSS 2008»
13 years 8 months ago
Cross-lingual thesaurus for multilingual knowledge management
The Web is a universal repository of human knowledge and culture which has allowed unprecedented sharing of ideas and information in a scale never seen before. It can also be cons...
Christopher C. Yang, Chih-Ping Wei, K. W. Li
DCOSS
2009
Springer
14 years 3 months ago
Fast Self-stabilization for Gradients
Abstract. Gradients are distributed distance estimates used as a building block in many sensor network applications. In large or long-lived deployments, it is important for the est...
Jacob Beal, Jonathan Bachrach, Daniel Vickery, Mar...