1569 search results - page 77 / 314 » Programming contest strategy |
SC
1992
ACM
14 years 2 months ago
1992
ACM
A common debugging strategy involves reexecuting a program (on a given input) over and over, each time gaining more information about bugs. Such techniques can fail on message-pas...
EOR
2010
13 years 10 months ago
2010
Abstract: Probabilistically constrained problems, in which the random variables are finitely distributed, are nonconvex in general and hard to solve. The p-efficiency concept has b...
ATAL
2008
Springer
14 years 13 hour 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 ...
RR
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. We illustrate the potential of conditional hedge transformations in Web-related applications on the example of PρLog: an extension of logic programming with advanced rul...
RTAS
2008
IEEE
14 years 4 months ago
2008
IEEE
We build on PTIDES, a programming model for distributed embedded systems that uses discrete-event (DE) models as program specifications. PTIDES improves on distributed DE executi...