Sciweavers

14518 search results - page 194 / 2904
» Two Problems for Sophistication
Sort
View
SIAMAM
2000
119views more  SIAMAM 2000»
13 years 10 months ago
The "Linear" Limit of Thin Film Flows as an Obstacle-Type Free Boundary Problem
We study the limit as n 0 of the nonnegative, self-similar source-type solutions of the thin film equation ut + (unuxxx)x = 0. We obtain a unique limiting function u, which is a s...
Fernando Quirós, Francisco Bernis, Josephus...
COR
1999
99views more  COR 1999»
13 years 10 months ago
Applications of modern heuristic search methods to pattern sequencing problems
This article describes applications of modern heuristic search methods to pattern sequencing problems, i.e., problems seeking for a permutation of the rows of a given matrix with r...
Andreas Fink, Stefan Voß
ICRA
2010
IEEE
119views Robotics» more  ICRA 2010»
13 years 9 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...
IPL
2010
80views more  IPL 2010»
13 years 9 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
14 years 5 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