1204 search results - page 42 / 241 » Termination of Polynomial Programs |
CAV
2009
Springer
14 years 11 months ago
2009
Springer
Abstract. Size-change termination involves deducing program termination based on the impossibility of infinite descent. To this end we may use m abstraction in which transitions ar...
EOR
2007
13 years 11 months ago
2007
The Service Allocation Problem (SAP) is a tactical problem arising in the yard management of a container transshipment terminal. The objective is the minimization of the container...
CP
2003
Springer
14 years 4 months ago
2003
Springer
Incomplete decision algorithms can often solve larger problem instances than complete ones. The drawback is that one does not know whether the algorithm will finish soon, later, ...
IFIP
2003
Springer
14 years 4 months ago
2003
Springer
As the mobility and the number of affordable, powerful, and highly portable devices becoming networked increases, so will the amount of networked services offered, managed and disc...
SODA
1990
ACM
14 years 4 days ago
1990
ACM
Given an unweighted planar graph G together with nets of terminals, our problem is to find a Steiner forest, i.e., vertex-disjoint trees, each of which interconnects all the termin...