1138 search results - page 83 / 228 » First-Order Model Checking Problems Parameterized by the Mod... |
SIBGRAPI
2000
IEEE
14 years 7 days ago
2000
IEEE
This paper presents a system that is being developed for the recognition of the handwritten legal amount in Brazilian bank checks. Our strategy used to approach the handwritten leg...
CCCG
2006
13 years 9 months ago
2006
A room is a simple polygon with a prespecified point, called the door, on its boundary. A search starts at the door and must detect any intruder that may be in the room, while maki...
CAV
2006
Springer
13 years 11 months ago
2006
Springer
We propose and evaluate a new algorithm for checking the universality of nondeterministic finite automata. In contrast to the standard algorithm, which uses the subset construction...
ICC
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract—We develop a family of distributed wireless scheduling algorithms that requires only O(1) complexity for M-hop interference model, for any finite M. The recent technolo...
CONCUR
1999
Springer
14 years 4 days ago
1999
Springer
In order to check whether an open system satisfies a desired property, we need to check the behavior of the system with respect to an arbitrary environment. In the most general se...