370 search results - page 29 / 74 » Independent Sets with Domination Constraints |
136
Voted
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
142
click to vote
INFOCOM
2003
IEEE
15 years 7 months ago
2003
IEEE
— Service discovery is an integral part of the ad hoc networking to achieve stand-alone and self-configurable communication networks. In this paper, we discuss possible service ...
IROS
2006
IEEE
15 years 8 months ago
2006
IEEE
Abstract— Grasp quality measures are important for understanding how to plan for and maintain appropriate and secure grasps for pick and place operations and tool use. Most grasp...
172
Voted
STOC
2012
ACM
13 years 4 months ago
2012
ACM
We obtain a characterization of feasible, Bayesian, multi-item multi-bidder mechanisms with independent, additive bidders as distributions over hierarchical mechanisms. Combined w...
119
Voted
FOCS
2009
IEEE
15 years 8 months ago
2009
IEEE
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...