Sciweavers

2905 search results - page 170 / 581
» Formal Memetic Algorithms
Sort
View
96
Voted
ATAL
2010
Springer
15 years 1 months ago
Strategy generation in multi-agent imperfect-information pursuit games
We describe a formalism and algorithms for game-tree search in partially-observable Euclidean space, and implementation and tests in a scenario where a multi-agent team, called tr...
Eric Raboin, Dana S. Nau, Ugur Kuter, Satyandra K....
92
Voted
IPMU
2010
Springer
14 years 11 months ago
Keeping Secrets in Possibilistic Knowledge Bases with Necessity-Valued Privacy Policies
Controlled Query Evaluation (CQE) is a logical framework for the protection of secrets in databases. In this article, we extend the CQE framework to possibilistic logic: knowledge ...
Lena Wiese
115
Voted
INLG
2010
Springer
14 years 10 months ago
Generating Referring Expressions with Reference Domain Theory
In this paper we present a reference generation model based on Reference Domain Theory which gives a dynamic account of reference. This reference model assumes that each referring...
Alexandre Denis
92
Voted
SIGDIAL
2010
14 years 10 months ago
Reference reversibility with Reference Domain Theory
In this paper we present a reference model based on Reference Domain Theory that can work both in interpretation and generation. We introduce a formalization of key concepts of RD...
Alexandre Denis
92
Voted
CVPR
2007
IEEE
16 years 2 months ago
Practical Online Active Learning for Classification
We compare the practical performance of several recently proposed algorithms for active learning in the online classification setting. We consider two active learning algorithms (...
Claire Monteleoni, Matti Kääriäinen