Sciweavers

10568 search results - page 465 / 2114
» Computer Intelligence and Formalization
Sort
View
AAAI
1997
15 years 6 months ago
Incremental Methods for Computing Bounds in Partially Observable Markov Decision Processes
Partially observable Markov decision processes (POMDPs) allow one to model complex dynamic decision or control problems that include both action outcome uncertainty and imperfect ...
Milos Hauskrecht
AIIDE
2009
15 years 6 months ago
Computational Support for Play Testing Game Sketches
Early-stage game prototypes need to be informative without requiring excessive commitments. Paper prototypes are frequently used as a way of trying out core mechanics while leavin...
Adam M. Smith, Mark J. Nelson, Michael Mateas
ATAL
2010
Springer
15 years 6 months ago
Combining statistics and arguments to compute trust
We propose a method for constructing Dempster-Shafer belief functions modeling the trust of a given agent (the evaluator) in another (the target) by combining statistical informat...
Paul-Amaury Matt, Maxime Morge, Francesca Toni
159
Voted
CEC
2007
IEEE
15 years 5 months ago
Entropy-based Memetic Particle Swarm Optimization for computing periodic orbits of nonlinear mappings
— The computation of periodic orbits of nonlinear mappings is very important for studying and better understanding the dynamics of complex systems. Evolutionary algorithms have s...
Y. G. Petalas, Konstantinos E. Parsopoulos, Michae...
KI
2007
Springer
15 years 4 months ago
Improving the Detection of Unknown Computer Worms Activity Using Active Learning
Detecting unknown worms is a challenging task. Extant solutions, such as anti-virus tools, rely mainly on prior explicit knowledge of specific worm signatures. As a result, after t...
Robert Moskovitch, Nir Nissim, Dima Stopel, Clint ...