6045 search results - page 66 / 1209 » Computable Linearizations of Well-partial-orderings |
TLCA
2009
Springer
14 years 2 months ago
2009
Springer
We introduce a Game Semantics where strategies are partial orders, and composition is a generalization of the merging of orders. Building on this, to bridge between Game Semantics ...
LSSC
2001
Springer
14 years 9 days ago
2001
Springer
In this paper we analyze a quasi-Monte Carlo method for solving systems of linear algebraic equations. It is well known that the convergence of Monte Carlo methods for numerical in...
ACL
2009
13 years 5 months ago
2009
We formulate the problem of nonprojective dependency parsing as a polynomial-sized integer linear program. Our formulation is able to handle non-local output features in an effici...
TCS
2010
13 years 2 months ago
2010
The theorem of factorization forests of Imre Simon shows the existence of nested factorizations -- `a la Ramsey -- for finite words. This theorem has important applications in sem...
FOSSACS
2011
Springer
12 years 11 months ago
2011
Springer
The model checking of higher-order recursion schemes has been actively studied and is now becoming a basis of higher-order program verification. We propose a new algorithm for tri...