Sciweavers

920 search results - page 59 / 184
» Computing the Frequency of Partial Orders
Sort
View
SLP
1993
110views more  SLP 1993»
13 years 11 months ago
Logic Program Specialisation With Deletion of Useless Clauses
In this paper we describe a method of programspecialisation and give an extended example of its application to specialisation of a refutation proof procedure for rst order logic. ...
D. Andre de Waal, John P. Gallagher
PAAMS
2010
Springer
14 years 2 months ago
An UCT Approach for Anytime Agent-Based Planning
In this paper, we introduce a new heuristic search algorithm based on mean values for anytime planning, called MHSP. It consists in associating the principles of UCT, a bandit-base...
Damien Pellier, Bruno Bouzy, Marc Métivier
JCSS
2010
112views more  JCSS 2010»
13 years 8 months ago
Towards a dichotomy for the Possible Winner problem in elections based on scoring rules
To make a joint decision, agents (or voters) are often required to provide their preferences as linear orders. To determine a winner, the given linear orders can be aggregated acc...
Nadja Betzler, Britta Dorn
DCC
2003
IEEE
14 years 9 months ago
PPM Model Cleaning
The Prediction by Partial Matching (PPM) algorithm uses a cumulative frequency count of input symbols in different contexts to estimate their probability distribution. Excellent c...
Milenko Drinic, Darko Kirovski, Miodrag Potkonjak
IJLT
2010
115views more  IJLT 2010»
13 years 8 months ago
Computer supported ubiquitous learning environment for vocabulary learning
: Ubiquitous computing could help the organisation and the mediation of social interactions wherever and whenever these situations might occur. Using those technologies enables the...
Hiroaki Ogata, Chengjiu Yin, Moushir M. El-Bishout...