3161 search results - page 461 / 633 » Hybrid results merging |
188
click to vote
IWDC
2005
Springer
16 years 1 days ago
2005
Springer
For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, calle...
159
click to vote
WEA
2005
Springer
16 years 11 hour ago
2005
Springer
Abstract. In this paper we consider the problem of computing a minimum cycle basis of an undirected graph G = (V, E) with n vertices and m edges. We describe an efficient implement...
172
click to vote
ESA
2004
Springer
15 years 12 months ago
2004
Springer
The computation of dominators in a flowgraph has applications in several areas, including program optimization, circuit testing, and theoretical biology. Lengauer and Tarjan [30]...
170
click to vote
ICRA
2003
IEEE
15 years 11 months ago
2003
IEEE
— This paper presents a general approach to specify and execute complex robot tasks considering uncertain environments. Robot tasks are defined by a precise definition of socal...
178
click to vote
ICANN
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. Solutions to the symbol grounding problem, in psychologically plausible cognitive models, have been based on hybrid connectionist/symbolic architectures, on robotic appro...