223 search results - page 22 / 45 » Proving Termination by Bounded Increase |
ATVA
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...
IPPS
2002
IEEE
14 years 3 months ago
2002
IEEE
Tabling or memoing is a technique where one stores intermediate answers to a problem so that they can be reused in further calls. Tabling is of interest to logic programming becau...
ICCAD
2000
IEEE
14 years 3 months ago
2000
IEEE
–An FPGA switch box is said to be hyper-universal if it is routable for all possible surrounding multi-pin net topologies satisfying the routing resource constraints. It is desir...
GIS
2006
ACM
13 years 10 months ago
2006
ACM
We present an algorithm for polyline (and polygon) similarity testing that is based on the double-cross formalism. To determine the degree of similarity between two polylines, the...
TWC
2008
13 years 10 months ago
2008
In this paper, we consider a class of energy-aware routing algorithm that explicitly takes into account the connectivity of the remaining sensor network. In typical sensor network ...