534 search results - page 90 / 107 » Proving Termination of Rewrite Systems Using Bounds |
114
Voted
RSA
2002
15 years 1 months ago
2002
: The decycling number (G) of a graph G is the smallest number of vertices which can be removed from G so that the resultant graph contains no cycles. In this paper, we study the d...
128
click to vote
ICFP
1999
ACM
15 years 6 months ago
1999
ACM
d Abstract) Assaf J. Kfoury∗ Boston University http://www.cs.bu.edu/˜kfoury Harry G. Mairson† Brandeis University http://www.cs.brandeis.edu/˜mairson Franklyn A. Turbak‡ We...
116
click to vote
IEEEPACT
1998
IEEE
15 years 6 months ago
1998
IEEE
Compile-time scheduling is one approach to extract parallelism which has proved effective when the execution behavior is predictable. Unfortunately, the performance of most priori...
115
click to vote
SPAA
2003
ACM
15 years 7 months ago
2003
ACM
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...
124
Voted
POPL
2010
ACM
15 years 11 months ago
2010
ACM
This paper describes a novel technique for the synthesis of imperative programs. Automated program synthesis has the potential to make programming and the design of systems easier...