Sciweavers

1511 search results - page 115 / 303
» On the effectiveness of address-space randomization
Sort
View
AIIDE
2008
13 years 10 months ago
Monte-Carlo Tree Search: A New Framework for Game AI
Classic approaches to game AI require either a high quality of domain knowledge, or a long time to generate effective AI behaviour. These two characteristics hamper the goal of es...
Guillaume Chaslot, Sander Bakkes, Istvan Szita, Pi...
IWUC
2004
13 years 9 months ago
On Uncertainty in Context-Aware Computing: Appealing to High-Level and Same-Level Context for Low-Level Context Verification
There is an inherent chasm between the real-world and the world that can be perceived by computer systems, yielding uncertainty and ambiguity in system perceived context, with cons...
Amir Padovitz, Seng Wai Loke, Arkady B. Zaslavsky
CORR
2008
Springer
74views Education» more  CORR 2008»
13 years 8 months ago
Analysis of the Karmarkar-Karp Differencing Algorithm
The Karmarkar-Karp differencing algorithm is the best known polynomial time heuristic for the number partitioning problem, fundamental in both theoretical computer science and stat...
Stefan Boettcher, Stephan Mertens
CONNECTION
2006
91views more  CONNECTION 2006»
13 years 8 months ago
From unknown sensors and actuators to actions grounded in sensorimotor perceptions
This article describes a developmental system based on information theory implemented on a real robot that learns a model of its own sensory and actuator apparatus. There is no in...
Lars Olsson, Chrystopher L. Nehaniv, Daniel Polani
CONNECTION
2006
101views more  CONNECTION 2006»
13 years 8 months ago
Learning acceptable windows of contingency
By learning a range of possible times over which the effect of an action can take place, a robot can reason more effectively about causal and contingent relationships in the world...
Kevin Gold, Brian Scassellati