Sciweavers

13987 search results - page 174 / 2798
» The Two Guards Problem
Sort
View
99
Voted
ICRA
2010
IEEE
119views Robotics» more  ICRA 2010»
15 years 2 months ago
Solving the continuous time multiagent patrol problem
— This paper compares two algorithms to solve a multiagent patrol problem with uncertain durations. The first algorithm is reactive and allows adaptive and robust behavior, whil...
Jean-Samuel Marier, Camille Besse, Brahim Chaib-dr...
119
Voted
IPL
2010
80views more  IPL 2010»
15 years 2 months ago
The reachability problem for branching vector addition systems requires doubly-exponential space
Branching vector addition systems are an extension of vector addition systems where new reachable vectors may be obtained by summing two reachable vectors and adding an integral v...
Ranko Lazic
ACCV
2009
Springer
15 years 10 months ago
A Probabilistic Model for Correspondence Problems Using Random Walks with Restart
Abstract. In this paper, we propose an efficient method for finding consistent correspondences between two sets of features. Our matching algorithm augments the discriminative pow...
Tae Hoon Kim, Kyoung Mu Lee, Sang Uk Lee
119
Voted
ACL
2009
15 years 1 months ago
Case markers and Morphology: Addressing the crux of the fluency problem in English-Hindi SMT
We report in this paper our work on accurately generating case markers and suffixes in English-to-Hindi SMT. Hindi is a relatively free word-order language, and makes use of a com...
Ananthakrishnan Ramanathan, Hansraj Choudhary, Avi...
140
Voted
SIAMDM
1998
89views more  SIAMDM 1998»
15 years 3 months ago
String Noninclusion Optimization Problems
For every string inclusion relation there are two optimization problems: find a longest string included in every string of a given finite language, and find a shortest string in...
Anatoly R. Rubinov, Vadim G. Timkovsky