2168 search results - page 185 / 434 » Randomized Algorithms and Complexity Theory |
123
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Many AI researchers and cognitive scientists have argued that analogy is the core of cognition. The most influential work on computational modeling of analogy-making is Structure ...
138
Voted
ADHOCNOW
2006
Springer
15 years 9 months ago
2006
Springer
We consider an ad-hoc network consisting of devices that try to gain access for transmission through a shared communication channel. We redesign randomized protocol of Cai, Lu and ...
147
Voted
COCO
1998
Springer
15 years 7 months ago
1998
Springer
We show that the perfect matching problem is in the complexity class SPL in the nonuniform setting. This provides a better upper bound on the complexity of the matching problem, a...
122
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Statistical learning theory chiefly studies restricted hypothesis classes, particularly those with finite Vapnik-Chervonenkis (VC) dimension. The fundamental quantity of interest i...
137
Voted
MP
2007
15 years 3 months ago
2007
We present a probabilistic analysis of integer linear programs (ILPs). More specifically, we study ILPs in a so-called smoothed analysis in which it is assumed that first an adve...