2446 search results - page 163 / 490 » Choiceless Polynomial Time |
160
click to vote
ASPDAC
2004
ACM
15 years 9 months ago
2004
ACM
— The problem of minimizing dynamic power consumption by scaling down the supply voltage of computational elements off critical paths is widely addressed in the literature for th...
145
click to vote
IFIP
2004
Springer
15 years 9 months ago
2004
Springer
We study the general packing problem with M constraints. In [Jansen and Zhang, TCS 2002] a c(1 + ε)-approximation algorithm for the general packing problem was proposed. A block s...
147
click to vote
ISAAC
2004
Springer
15 years 9 months ago
2004
Springer
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...
152
click to vote
NMR
2004
Springer
15 years 9 months ago
2004
Springer
We define the class of head-cycle free nested logic programs, and its proper subclass of acyclic nested programs, generalising similar classes originally defined for disjunctive...
153
click to vote
SIGECOM
2003
ACM
15 years 9 months ago
2003
ACM
We examine correlated equilibria in the recently introduced formalism of graphical games, a succinct representation for multiplayer games. We establish a natural and powerful rela...