Sciweavers

736 search results - page 131 / 148
» A dynamic data structure for approximate range searching
Sort
View
AIPS
2010
13 years 11 months ago
When Policies Can Be Trusted: Analyzing a Criteria to Identify Optimal Policies in MDPs with Unknown Model Parameters
Computing a good policy in stochastic uncertain environments with unknown dynamics and reward model parameters is a challenging task. In a number of domains, ranging from space ro...
Emma Brunskill
PLDI
2006
ACM
14 years 2 months ago
DieHard: probabilistic memory safety for unsafe languages
Applications written in unsafe languages like C and C++ are vulnerable to memory errors such as buffer overflows, dangling pointers, and reads of uninitialized data. Such errors ...
Emery D. Berger, Benjamin G. Zorn
COLING
2000
13 years 10 months ago
Language Identification In Unknown Signals
This paper describes algorithms and software developed to characterise and detect generic intelligent language-like features iu an input signal, using Natural Language Learning te...
John R. Elliott, Eric Atwell, Bill Whyte
ICDM
2008
IEEE
106views Data Mining» more  ICDM 2008»
14 years 3 months ago
Boosting Relational Sequence Alignments
The task of aligning sequences arises in many applications. Classical dynamic programming approaches require the explicit state enumeration in the reward model. This is often impr...
Andreas Karwath, Kristian Kersting, Niels Landwehr
AAAI
2008
13 years 11 months ago
Planning for Human-Robot Interaction Using Time-State Aggregated POMDPs
In order to interact successfully in social situations, a robot must be able to observe others' actions and base its own behavior on its beliefs about their intentions. Many ...
Frank Broz, Illah R. Nourbakhsh, Reid G. Simmons