1716 search results - page 184 / 344 » Proving Conditional Termination |
106
Voted
COCOON
2008
Springer
15 years 2 months ago
2008
Springer
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s V and a set M...
111
Voted
AIML
2008
15 years 2 months ago
2008
In 1983, Valentini presented a syntactic proof of cut-elimination for a sequent calculus GLSV for the provability logic GL where we have added the subscript V for "Valentini&q...
106
click to vote
AI
2006
Springer
15 years 25 days ago
2006
Springer
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...
93
Voted
FUIN
2008
15 years 25 days ago
2008
This paper is concerned with the universality problem for timed automata: given a timed automaton A, does A accept all timed words? Alur and Dill have shown that the universality p...
104
click to vote
CEE
2007
15 years 23 days ago
2007
It is a challenge to implement large word length public-key algorithms on embedded systems. Examples are smartcards, RF-ID tags and mobile terminals. This paper presents a HW/SW c...