Sciweavers

8025 search results - page 382 / 1605
» Combinators Introduction: An Algorithm
Sort
View
ICCS
2003
Springer
16 years 1 days ago
Counting Polyominoes: A Parallel Implementation for Cluster Computing
The exact enumeration of most interesting combinatorial problems has exponential computational complexity. The finite-lattice method reduces this complexity for most two-dimension...
Iwan Jensen
ECP
1999
Springer
138views Robotics» more  ECP 1999»
15 years 11 months ago
Numeric State Variables in Constraint-Based Planning
We extend a planning algorithm to cover simple forms of arithmetics. The operator preconditions can refer to the values of numeric variables and the operator postconditions can mod...
Jussi Rintanen, Hartmut Jungholt
CG
2006
Springer
15 years 10 months ago
A Skat Player Based on Monte-Carlo Simulation
We apply Monte Carlo simulation and alpha-beta search to the card game of Skat, which is similar to Bridge, but different enough to require some new algorithmic ideas besides the t...
Sebastian Kupferschmid, Malte Helmert
SAS
1997
Springer
111views Formal Methods» more  SAS 1997»
15 years 10 months ago
Fast and Effective Procedure Inlining
is an important optimization for programs that use procedural abstraction. Because inlining trades code size for execution speed, the effectiveness of an inlining algorithm is det...
Oscar Waddell, R. Kent Dybvig
ATAL
2008
Springer
15 years 8 months ago
Emerging coordination in infinite team Markov games
In this paper we address the problem of coordination in multi-agent sequential decision problems with infinite statespaces. We adopt a game theoretic formalism to describe the int...
Francisco S. Melo, M. Isabel Ribeiro