2079 search results - page 90 / 416 » Universality of random graphs |
141
click to vote
APPROX
2009
Springer
15 years 11 months ago
2009
Springer
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
104
click to vote
APAL
2008
15 years 4 months ago
2008
We show that for random bit strings, Up(n), with probability, p = 1 2 , the firstorder quantifier depth D(Up(n)) needed to distinguish non-isomorphic structures is (lg lg n), with...
119
click to vote
ASM
2005
ASM
15 years 10 months ago
2005
ASM
lation of BGS model of Abstract State Machines Comandur Seshadhri1 , Anil Seth2 , and Somenath Biswas2 1 Department of Computer Science Princeton University, Princeton NJ 08544, US...
137
click to vote
CP
2000
Springer
15 years 8 months ago
2000
Springer
plexity Theorems: Talk Abstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 David McAllester Regular Papers Automatic Generation of Propagation Rules for F...
151
click to vote
CAINE
2008
15 years 5 months ago
2008
This article is about the new universal architecture which allows electronic devices of different functionalities and manufacturers, as well as on-line services, to seamlessly int...