20294 search results - page 431 / 4059 » Algorithmic Information Theory |
234
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
Proof nets are a graph theoretical representation of proofs in various fragments of type-logical grammar. In spite of this basis in graph theory, there has been relatively little ...
175
click to vote
AAAI
1990
15 years 8 months ago
1990
The purpose of this paper is to characterize a constituent boundary parsing algorithm, using an information-theoretic measure called generalized mutual information, which serves a...
244
click to vote
SODA
2010
ACM
16 years 5 months ago
2010
ACM
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...
138
click to vote
ISAAC
2007
Springer
16 years 1 months ago
2007
Springer
In this paper we give a finer separation of several known paging algorithms. This is accomplished using a new technique that we call relative interval analysis. This technique com...
186
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract-- In this paper, we are interested in using largedeviations theory to characterize the asymptotic decay-rate of the queue-overflow probability for distributed wireless sch...