4377 search results - page 302 / 876 » Mass problems and randomness |
168
click to vote
SIAMCOMP
2008
15 years 6 months ago
2008
![Resolution Is Not Automatizable Unless W[P] Is Tractable](http://sciweavers.com/files/imagecache/thumbnail/default/content.jpg "Resolution Is Not Automatizable Unless W[P] Is Tractable")
We show that neither Resolution nor tree-like Resolution is automatizable unless the class W[P] from the hierarchy of parameterized problems is fixed-parameter tractable by randomi...
151
click to vote
TIT
2002
15 years 6 months ago
2002
We extend a low-rate improvement of the random coding bound on the reliability of a classical discrete memoryless channel (DMC) to its quantum counterpart. The key observation that...
284
click to vote
WAOA
2010
Springer
15 years 4 months ago
2010
Springer
We study the problem of producing a global ranking of items given pairwise ranking information, when the items to be ranked arrive in an online fashion. We study both the maximizat...
133
click to vote
ICRA
2005
IEEE
16 years 10 days ago
2005
IEEE
— Minimum distance localization is the problem of finding the shortest possible path for a robot to eliminate ambiguity regarding its position in the environment. We consider th...
181
click to vote
ESA
2005
Springer
16 years 8 days ago
2005
Springer
We present a simple two-person Bucket Game, based on throwing balls into buckets, and we discuss possible players’ strategies. We use these strategies to create an approximation ...