697 search results - page 52 / 140 » On the Theory of Average Case Complexity |
ECAI
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. We call verification the process of finding the actual explanation of a given set of manifestations. We consider an abductive setting, in which explanations are sets of a...
ICCBR
1995
Springer
13 years 11 months ago
1995
Springer
The particular strength of CBR is normally considered to be its use in weak theory domains where solution quality is compiled into cases and is reusable. In this paper we explore a...
DAGSTUHL
2007
13 years 9 months ago
2007
Computational social choice is an interdisciplinary eld of study at the interface of social choice theory and computer science, with knowledge owing in either direction. On the o...
DIALM
2004
ACM
14 years 1 months ago
2004
ACM
Coping with mobility and dynamism is one of the biggest challenges in ad hoc networks. An essential requirement for such networks is a service that can establish communication ses...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several st...