Sciweavers

1146 search results - page 114 / 230
» On the Complexity of Domain-Independent Planning
Sort
View
ALDT
2009
Springer
142views Algorithms» more  ALDT 2009»
14 years 3 months ago
Finding Best k Policies
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
Peng Dai, Judy Goldsmith
ATAL
2009
Springer
14 years 3 months ago
Stigmergic reasoning over hierarchical task networks
Stigmergy is usually associated with semantically simple problems such as routing. It can be applied to more complex problems by encoding them in the environment through which sti...
H. Van Dyke Parunak, Theodore C. Belding, Robert B...
ANSS
2007
IEEE
14 years 3 months ago
The JMT Simulator for Performance Evaluation of Non-Product-Form Queueing Networks
This paper describes JSIM: the simulation module of the Java Modelling Tools (JMT), an open-source fully-portable Java suite for capacity planning studies. The simulator has been ...
Marco Bertoli, Giuliano Casale, Giuseppe Serazzi
VL
2007
IEEE
132views Visual Languages» more  VL 2007»
14 years 3 months ago
A Study on Applying Roles of Variables in Introductory Programming
Expert programmers possess programming knowledge, which is language independent and abstract. Still, programming is mostly taught only via constructs of a programming language and...
Pauli Byckling, Jorma Sajaniemi
ACMACE
2005
ACM
14 years 2 months ago
Integrate and conquer: the next generation of intelligent avatars
FreeWill+ is a framework that aims at integrating various animation techniques for controlling human-like characters. With heterogeneity and multi-layering as its main design prin...
Jaroslaw Francik, Adam Szarowicz