1204 search results - page 28 / 241 » Termination of Polynomial Programs |
135
Voted
SCP
2002
15 years 5 months ago
2002
It is common for a real-time system to contain a nonterminating process monitoring an input and controlling an output. Hence, a real-time program development method needs to suppo...
153
click to vote
FOCS
1999
IEEE
15 years 10 months ago
1999
IEEE
We consider the DIRECTED STEINER NETWORK problem, also called the POINT-TO-POINT CONNECTION problem, where given a directed graph G and p pairs {(s1,t1),...,(sp,tp)} of nodes in t...
155
Voted
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
170
click to vote
AGP
1994
IEEE
15 years 9 months ago
1994
IEEE
Kowalski and Sergot's Event Calculus (EC) is a formalism for reasoning about time and change in a logic programming framework. From a description of events which occur in the...
151
click to vote
ACSC
2004
IEEE
15 years 9 months ago
2004
IEEE
This paper introduces a repeatable and constructive approach to the analysis of loop progress and termination conditions in imperative programs. It is applicable to all loops for ...