1204 search results - page 104 / 241 » Termination of Polynomial Programs |
97
Voted
SPIN
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. In this article, we address the problem of statically determining an approximation of the communication topology of concurrent programs. These programs may contain dynami...
CSL
1995
Springer
15 years 4 months ago
1995
Springer
In this paper we propose to extend the current capabilities of automated reasoning systems by making use of techniques from integer programming. We describe the architecture of an ...
95
Voted
ICAI
2007
15 years 2 months ago
2007
Abstract— The paper proposes a dynamic programming algorithm for training of functional networks. The algorithm considers each node as a state. The problem is formulated as find...
113
Voted
ENTCS
2010
15 years 24 days ago
2010
Solutions of recursive program schemes over a given signature were characterized by Bruno Courcelle as precisely the context-free (or algebraic) -trees. These are the finite and ...
97
Voted
ECCC
2007
15 years 20 days ago
2007
We recover the first linear programming bound of McEliece, Rodemich, Rumsey, and Welch for binary error-correcting codes and designs via a covering argument. It is possible to sh...