5995 search results - page 351 / 1199 » Algorithmic Game Theory |
191
click to vote
DAM
2000
15 years 6 months ago
2000
We use basic results from graph theory to design algorithms for constructing three-dimensional, intersection-free orthogonal grid drawings of n vertex graphs of maximum degree 6. ...
192
click to vote
AAAI
1993
15 years 8 months ago
1993
learning (EBL) component. In this paper we provide a brief review of FOIL and FOCL, then discuss how operationalizing a domain theory can adversely affect the accuracy of a learned...
180
click to vote
ICASSP
2008
IEEE
16 years 1 months ago
2008
IEEE
The theory of compressive sensing has shown that sparse signals can be reconstructed exactly from many fewer measurements than traditionally believed necessary. In [1], it was sho...
124
click to vote
MLQ
1998
15 years 6 months ago
1998
This paper presents a new method – which does not rely on the cut-elimination theorem – for characterizing the provably total functions of certain intuitionistic subsystems of ...
169
click to vote
ALT
2008
Springer
16 years 3 months ago
2008
Springer
This paper studies Dawid’s prequential framework from the point of view of the algorithmic theory of randomness. The main result is that two natural notions of randomness coincid...