363 search results - page 50 / 73 » The SAT Phase Transition |
COLT
2000
Springer
13 years 11 months ago
2000
Springer
Haussler, Kearns, Seung and Tishby introduced the notion of a shell decomposition of the union bound as a means of understanding certain empirical phenomena in learning curves suc...
CP
1999
Springer
13 years 11 months ago
1999
Springer
This paper presents DisAC-9, the first optimal distributed algorithm performing the arc-consistency of a constraint network. Our method is optimal according to the number of messa...
COLT
1994
Springer
13 years 11 months ago
1994
Springer
In this paper we introduce and investigate a mathematically rigorous theory of learning curves that is based on ideas from statistical mechanics. The advantage of our theory over ...
APLAS
2007
ACM
13 years 11 months ago
2007
ACM
This paper studies types and probabilistic bisimulations for a timed -calculus as an effective tool for a compositional analysis of probabilistic distributed behaviour. The types c...
EVOW
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We introduce a novel representation for the graph colouring problem, called the Integer Merge Model, which aims to reduce the time complexity of an algorithm. Moreover, o...