9842 search results - page 161 / 1969 » Problem complexity |
LPAR
2000
Springer
15 years 5 months ago
2000
Springer
In this paper, we determine the complexity of propositional theory curbing. Theory Curbing is a nonmonotonic technique of common sense reasoning that is based on model minimality b...
JELIA
2004
Springer
15 years 7 months ago
2004
Springer
Boolean games are a class of two-player games which may be defined via a Boolean form over a set of atomic actions. A particular game on some form is instantiated by partitioning ...
116
click to vote
ADHOCNOW
2008
Springer
15 years 8 months ago
2008
Springer
We study two algorithmical problems inspired from routing constraints in a multihop synchronous radio network. Our objective is to satisfy a given set of communication requests in ...
102
click to vote
ECCC
2006
15 years 2 months ago
2006
We investigate the computational complexity of finding an element of a permutation group H Sn with a minimal distance to a given Sn, for different metrics on Sn. We assume that...
146
Voted
INFOCOM
2007
IEEE
15 years 8 months ago
2007
IEEE
— In this work, we study the problem of minimizing the total power consumption in a multi-hop wireless network subject to a given offered load. It is well-known that the total po...