314 search results - page 41 / 63 » The Complexity of Coverage |
109
Voted
RECSYS
2010
ACM
15 years 2 months ago
2010
ACM
Since the development of the comparably simple neighborhood-based methods in the 1990s, a plethora of techniques has been developed to improve various aspects of collaborative fil...
116
Voted
ICRA
2007
IEEE
15 years 8 months ago
2007
IEEE
— Given a robot model and a class of admissible environments, this paper provides a framework for automatically and verifiably composing controllers that satisfy high level task...
117
click to vote
CCGRID
2010
IEEE
15 years 3 months ago
2010
IEEE
Abstract--Resource discovery is a challenging issue in unstructured peer-to-peer networks. Blind search approaches, including flooding and random walks, are the two typical algorit...
122
click to vote
ICRA
2009
IEEE
15 years 8 months ago
2009
IEEE
— In this paper, we propose a path planning method for nonholonomic multi-vehicle system in presence of moving obstacles. The objective is to find multiple fixed length paths f...
196
Voted
ICST
2011
IEEE
14 years 5 months ago
2011
IEEE
—The length of test cases is a little investigated topic in search-based test generation for object oriented software, where test cases are sequences of method calls. While intui...