Sciweavers

4865 search results - page 728 / 973
» The Complexity of Graph Connectivity
Sort
View
IJRR
2008
92views more  IJRR 2008»
15 years 4 months ago
Robust and Efficient Covering of Unknown Continuous Domains with Simple, Ant-Like A(ge)nts
We propose a new `Mark-Ant-Walk' algorithm for robust and efficient covering of continuous domains by ant-like robots with very limited capabilities. The robots can mark plac...
Eliyahu Osherovich, Vladimir Yanovski, Israel A. W...
WINET
2010
185views more  WINET 2010»
15 years 2 months ago
TDMA scheduling algorithms for wireless sensor networks
Abstract Algorithms for scheduling TDMA transmissions in multi-hop networks usually determine the smallest length conflict-free assignment of slots in which each link or node is a...
Sinem Coleri Ergen, Pravin Varaiya
ACL
2009
15 years 2 months ago
Sentence diagram generation using dependency parsing
Dependency parsers show syntactic relations between words using a directed graph, but comparing dependency parsers is difficult because of differences in theoretical models. We de...
Elijah Mayfield
FAST
2009
15 years 2 months ago
Causality-Based Versioning
Versioning file systems provide the ability to recover from a variety of failures, including file corruption, virus and worm infestations, and user mistakes. However, using versio...
Kiran-Kumar Muniswamy-Reddy, David A. Holland
ICWSM
2009
15 years 2 months ago
Targeting Sentiment Expressions through Supervised Ranking of Linguistic Configurations
User generated content is extremely valuable for mining market intelligence because it is unsolicited. We study the problem of analyzing users' sentiment and opinion in their...
Jason S. Kessler, Nicolas Nicolov