395 search results - page 52 / 79 » Positive Versions of Polynomial Time |
154
click to vote
IWPEC
2004
Springer
15 years 12 months ago
2004
Springer
In the precoloring extension problem (PrExt) a graph is given with some of the vertices having a preassigned color and it has to be decided whether this coloring can be extended to...
167
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
We describe how to take a set of interaction traces produced by different pairs of players in a two-player repeated game, and combine them into a composite strategy. We provide an...
190
click to vote
ORDER
2008
15 years 6 months ago
2008
Given a poset P = (X, ), a partition X1, . . . , Xk of X is called an ordered partition of P if, whenever x Xi and y Xj with x y, then i j. In this paper, we show that for ever...
186
click to vote
EWSN
2004
Springer
16 years 6 months ago
2004
Springer
We consider the problem of inter-cluster routing between cluster heads via intermediate sensor nodes in a hierarchical sensor network. Sensor nodes having limited and unreplenishab...
161
click to vote
INFOCOM
2008
IEEE
16 years 1 months ago
2008
IEEE
— The relay node placement problem for wireless sensor networks is concerned with placing a minimum number of relay nodes into a wireless sensor network to meet certain connectiv...