Sciweavers

13987 search results - page 37 / 2798
» The Two Guards Problem
Sort
View
CPM
2004
Springer
86views Combinatorics» more  CPM 2004»
13 years 11 months ago
Two Algorithms for LCS Consecutive Suffix Alignment
The problem of comparing two sequences A and B to determine their similarity is one of the fundamental problems in pattern matching. A challenging, basic variation of the sequence...
Gad M. Landau, Eugene W. Myers, Michal Ziv-Ukelson
ICCSA
2007
Springer
14 years 1 months ago
Weak Visibility of Two Objects in Planar Polygonal Scenes
Abstract. Determining whether two segments s and t in a planar polygonal scene weakly see each other is a classical problem in computational geometry. In this problem we seek for a...
Mostafa Nouri, Alireza Zarei, Mohammad Ghodsi
HYBRID
2001
Springer
14 years 6 days ago
Robust Controller Synthesis for Hybrid Systems Using Modal Logic
Abstract. In this paper, we formulate and robustly solve a quite general class of hybrid controller synthesis problems. The type of controller we investigate is the switching contr...
Thomas Moor, Jennifer M. Davoren
FORMATS
2006
Springer
13 years 11 months ago
Symbolic Robustness Analysis of Timed Automata
We propose a symbolic algorithm for the analysis of the robustness of timed automata, that is the correctness of the model in presence of small drifts on the clocks or imprecision ...
Conrado Daws, Piotr Kordy
AGP
1995
IEEE
13 years 11 months ago
Domain Independent Ask Approximation in CCP
The main difficulty in the formalization of a static analysis framework for CC programs is probably related to the correct approximation of the entailment relation between constrai...
Enea Zaffanella