Sciweavers

1047 search results - page 64 / 210
» Learning the required number of agents for complex tasks
Sort
View
ENTCS
2006
153views more  ENTCS 2006»
13 years 7 months ago
Automatic Complexity Analysis for Programs Extracted from Coq Proof
We describe an automatic complexity analysis mechanism for programs extracted from proofs carried out with the proof assistant Coq. By extraction, we mean the automatic generation...
Jean-Pierre Jouannaud, Weiwen Xu
AH
2004
Springer
14 years 1 months ago
Developing Active Learning Experiences for Adaptive Personalised eLearning
Developing adaptive, rich-media, eLearning courses tends to be a complex, highly-expensive and time-consuming task. A typical adaptive eLearning course will involve a multi-skilled...
Declan Dagger, Vincent P. Wade, Owen Conlan
AAAI
2006
13 years 9 months ago
Automatically Labeling the Inputs and Outputs of Web Services
Information integration systems combine data from multiple heterogeneous Web services to answer complex user queries, provided a user has semantically modeled the service first. T...
Kristina Lerman, Anon Plangprasopchok, Craig A. Kn...
MHCI
2004
Springer
14 years 1 months ago
Mobile Context Aware Systems: The Intelligence to Support Tasks and Effectively Utilise Resources
: The complex usage of mobile devices coupled with their limited resources in terms of display and processing suggests that being able to understand the context of the user would b...
Russell Beale, Peter Lonsdale
IPPS
2006
IEEE
14 years 1 months ago
Distributed algorithm for a color assignment on asynchronous rings
We study a version of the β-assignment problem [3] on asynchronous rings: consider a set of items and a set of m colors, where each item is associated to one color. Consider also...
Gianluca De Marco, Mauro Leoncini, Manuela Montang...