Sciweavers

1569 search results - page 139 / 314
» Programming contest strategy
Sort
View
ATAL
2008
Springer
15 years 2 months ago
Playing games for security: an efficient exact algorithm for solving Bayesian Stackelberg games
In a class of games known as Stackelberg games, one agent (the leader) must commit to a strategy that can be observed by the other agent (the follower or adversary) before the adv...
Praveen Paruchuri, Jonathan P. Pearce, Janusz Mare...
96
Voted
CORR
2010
Springer
83views Education» more  CORR 2010»
15 years 21 days ago
Swapping Evaluation: A Memory-Scalable Solution for Answer-On-Demand Tabling
One of the differences among the various approaches to suspension-based tabled evaluation is the scheduling strategy. The two most popular strategies are local and batched evaluat...
Pablo Chico de Guzmán, Manuel Carro, David ...
CADE
2008
Springer
16 years 28 days ago
Compositional Proofs with Symbolic Execution
Abstract. A proof method is described which combines compositional proofs of interleaved parallel programs with the intuitive and highly automatic strategy of symbolic execution. A...
Simon Bäumler, Florian Nafz, Michael Balser, ...
77
Voted
ICFP
2002
ACM
16 years 17 days ago
Final shift for call/cc: : direct implementation of shift and reset
We present a direct implementation of the shift and reset control operators in the Scheme 48 system. The new implementation improves upon the traditional technique of simulating s...
Martin Gasbichler, Michael Sperber
GECCO
2007
Springer
167views Optimization» more  GECCO 2007»
15 years 6 months ago
Genetically designed heuristics for the bin packing problem
The bin packing problem (BPP) is a real-world problem that arises in different industrial applications related to minimization of space or time. The aim of this research is to au...
Oana Muntean