1433 search results - page 52 / 287 » On Covering Problems of Rado |
102
click to vote
WOWMOM
2009
ACM
15 years 6 months ago
2009
ACM
Random Walks (RWs) have been considered for information dissemination in large scale, dynamic and unstructured environments, as they are scalable, robust to topology changes and d...
CEC
2005
IEEE
15 years 5 months ago
2005
IEEE
In case the objective function to be minimized is not known analytically and no assumption can be made about the single extremum, global optimization (GO) methods must be used. Pap...
ICRA
2005
IEEE
15 years 5 months ago
2005
IEEE
— In this paper we address the problem of generating a motion strategy to find an object in a known 3-D environment as quickly as possible on average. We use a sampling scheme t...
120
click to vote
JMLR
2002
14 years 11 months ago
2002
Recently, sample complexity bounds have been derived for problems involving linear functions such as neural networks and support vector machines. In many of these theoretical stud...
STRINGOLOGY
2008
15 years 1 months ago
2008
Abstract. We study the problem of finding local and global covers as well as seeds in conservative indeterminate strings. An indeterminate string is a sequence T = T[1]T[2] . . . T...