1277 search results - page 80 / 256 » Terminating Decision Algorithms Optimally |
139
Voted
INFOCOM
2007
IEEE
15 years 9 months ago
2007
IEEE
Abstract— We consider the scenario of distributed data aggregation in wireless sensor networks, where each sensor can obtain and estimate the information of the whole sensing fi...
154
click to vote
WADS
2007
Springer
15 years 9 months ago
2007
Springer
We present a polynomial-time approximation scheme (PTAS) for the Steiner tree problem with polygonal obstacles in the plane with running time O(n log2 n), where n denotes the numb...
109
click to vote
SSWMC
2004
15 years 4 months ago
2004
We analyze the complexity of the steganography problem and show that the decision version of the problem is NP-complete through transformation from the Knapsack problem. We also g...
143
click to vote
ALDT
2009
Springer
15 years 10 months ago
2009
Springer
We present an anytime multiagent learning approach to satisfy any given optimality criterion in repeated game self-play. Our approach is opposed to classical learning approaches fo...
128
click to vote
ERSHOV
1999
Springer
15 years 7 months ago
1999
Springer
We extend positive supercompilation to handle negative as well as positive information. This is done by instrumenting the underlying unfold rules with a small rewrite system that h...