1322 search results - page 164 / 265 » Parameterized counting problems |
167
click to vote
TROB
2011
14 years 11 months ago
2011
— This paper defines and analyzes a simple robot with local sensors that moves in an unknown polygonal environment. The robot can execute wall-following motions and can traverse...
143
click to vote
STACS
1992
Springer
15 years 8 months ago
1992
Springer
We show that the graph isomorphism problem is low for PP and for C=P, i.e., it does not provide a PP or C=P computation with any additional power when used as an oracle. Furthermor...
136
click to vote
COMPGEOM
1995
ACM
15 years 7 months ago
1995
ACM
The range searching problem is a fundamental problem in computational geometry, with numerous important applications. Most research has focused on solving this problem exactly, bu...
140
Voted
DISOPT
2007
15 years 3 months ago
2007
The class Max (r, 2)-CSP (or simply Max 2-CSP) consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m bin...
155
Voted
WCNC
2008
IEEE
15 years 10 months ago
2008
IEEE
—1 In ISM bands, many wireless protocols proliferate such as 802.11, Bluetooth, and ZigBee. However, these incompatible protocols create complex coexistence and connectivity prob...