9842 search results - page 226 / 1969 » The Complexity of the Matching-Cut Problem |
108
click to vote
NIPS
1992
15 years 4 months ago
1992
This paper describes the adaption and application of an algorithm called Feudal Reinforcement Learning to a complex gridworld navigation problem. The algorithm proved to be not ea...
159
Voted
PCM
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Due to its great ability of conquering clutters, which is especially useful for high-dimensional tracking problems, particle filter becomes popular in the visual trackin...
123
Voted
IWPEC
2009
Springer
15 years 10 months ago
2009
Springer
We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both proble...
127
click to vote
STACS
2005
Springer
15 years 8 months ago
2005
Springer
Dynamic complexity investigates the required effort to maintain knowledge about a property of a structure under changing operations. This article introduces a refined notion of ...
103
Voted
IAT
2009
IEEE
15 years 10 months ago
2009
IEEE
We address the problem of multi-UAV surveillance in complex urban environments with occlusions. The problem consists of coordinating the flight of UAVs with on-board cameras so t...