Sciweavers

309 search results - page 10 / 62
» Partial Move A*
Sort
View
JMLR
2010
103views more  JMLR 2010»
13 years 4 months ago
Regret Bounds and Minimax Policies under Partial Monitoring
This work deals with four classical prediction settings, namely full information, bandit, label efficient and bandit label efficient as well as four different notions of regret: p...
Jean-Yves Audibert, Sébastien Bubeck
OAS
2003
13 years 11 months ago
Using OWL in a Pervasive Computing Broker
Computing is moving toward a pervasive context-aware environment in which agents with limited resources will require external support to help them become context-aware. In this pa...
Harry Chen, Timothy W. Finin, Anupam Joshi
JSC
2007
71views more  JSC 2007»
13 years 9 months ago
Rational invariants of a group action. Construction and rewriting
Geometric constructions applied to a rational action of an algebraic group lead to a new algorithm for computing rational invariants. A finite generating set of invariants appear...
Evelyne Hubert, Irina A. Kogan
LREC
2008
74views Education» more  LREC 2008»
13 years 11 months ago
Robust Parsing with a Large HPSG Grammar
In this paper we propose a partial parsing model which achieves robust parsing with a large HPSG grammar. Constraint-based precision grammars, like the HPSG grammar we are using f...
Yi Zhang 0003, Valia Kordoni
NICSO
2010
Springer
13 years 8 months ago
Partial Imitation Rule in Iterated Prisoner Dilemma Game on a Square Lattice
t] A realistic replacement of the general imitation rule in the Iterated Prisoner Dilemma (IPD) is investigated with simulation on square lattice, whereby the player, with finite m...
Degang Wu, Mathis Antony, Kwok Yip Szeto