Sciweavers

200 search results - page 34 / 40
» Multi-dimensional Dynamic Knowledge Representation
Sort
View
KR
2010
Springer
14 years 7 days ago
One Hundred Prisoners and a Lightbulb - Logic and Computation
This is a case-study in knowledge representation. We analyze the ‘one hundred prisoners and a lightbulb’ puzzle. In this puzzle it is relevant what the agents (prisoners) know...
Hans P. van Ditmarsch, Jan van Eijck, William Wu
WWW
2011
ACM
13 years 2 months ago
A word at a time: computing word relatedness using temporal semantic analysis
Computing the degree of semantic relatedness of words is a key functionality of many language applications such as search, clustering, and disambiguation. Previous approaches to c...
Kira Radinsky, Eugene Agichtein, Evgeniy Gabrilovi...
AMAST
2008
Springer
13 years 9 months ago
Service Specification and Matchmaking Using Description Logic
ed Abstract an extended abstract of [11]. Service-oriented computing is emerging as a new paradigm based on autonomous, platform-independent computational entities, called services...
M. Birna van Riemsdijk, Rolf Hennicker, Martin Wir...
ENTCS
2006
1305views more  ENTCS 2006»
13 years 7 months ago
Communication Attitudes: A Formal Approach to Ostensible Intentions, and Individual and Group Opinions
Conventional approaches to the modeling of autonomous agents and agent communication rely heavily on the ascription of mental properties like beliefs and intentions to the individ...
Matthias Nickles, Felix A. Fischer, Gerhard Wei&sz...
JMLR
2006
124views more  JMLR 2006»
13 years 7 months ago
Policy Gradient in Continuous Time
Policy search is a method for approximately solving an optimal control problem by performing a parametric optimization search in a given class of parameterized policies. In order ...
Rémi Munos