6575 search results - page 1101 / 1315 » Specializing visualization algorithms |
114
click to vote
STOC
1991
ACM
15 years 5 months ago
1991
ACM
The study of self-testing/correcting programs was introduced in [8] in order to allow one to use program P to compute function f without trusting that P works correctly. A self-te...
166
click to vote
FUN
2010
Springer
15 years 5 months ago
2010
Springer
In job scheduling with precedence constraints, i j means that job j cannot start being processed before job i is completed. In this paper we consider selfish bully jobs who do no...
143
click to vote
COCO
2010
Springer
15 years 5 months ago
2010
Springer
A PCP is a proof system for NP in which the proof can be checked by a probabilistic verifier. The verifier is only allowed to read a very small portion of the proof, and in return ...
118
Voted
GLOBECOM
2009
IEEE
15 years 5 months ago
2009
IEEE
—This paper considers a non-cooperative game in which competing users sharing a frequency-selective interference channel selfishly optimize their power allocation in order to imp...
97
Voted
ATAL
2008
Springer
15 years 4 months ago
2008
Springer
We demonstrate two game theory-based programs for headsup limit and no-limit Texas Hold'em poker. The first player, GS3, is designed for playing limit Texas Hold'em, in ...