Sciweavers

782 search results - page 80 / 157
» Can a Parser be Generated from Examples
Sort
View
144
Voted
JMLR
2012
13 years 6 months ago
SpeedBoost: Anytime Prediction with Uniform Near-Optimality
We present SpeedBoost, a natural extension of functional gradient descent, for learning anytime predictors, which automatically trade computation time for predictive accuracy by s...
Alexander Grubb, Drew Bagnell
JSW
2008
73views more  JSW 2008»
15 years 3 months ago
Teaching Virtual Experts for Multi-Domain Collaborative Planning
Abstract-- This paper presents an approach to rapid development of virtual planning experts that can collaborate to develop plans of action requiring expertise from multiple domain...
Gheorghe Tecuci, Mihai Boicu, Dorin Marcu, Marcel ...
168
Voted
ADAPTIVE
2007
Springer
15 years 10 months ago
Semantic Web Technologies for the Adaptive Web
Ontologies and reasoning are the key terms brought into focus by the semantic web community. Formal representation of ontologies in a common data model on the web can be taken as a...
Peter Dolog, Wolfgang Nejdl
122
Voted
EUROPAR
2007
Springer
15 years 10 months ago
Decision Trees and MPI Collective Algorithm Selection Problem
Selecting the close-to-optimal collective algorithm based on the parameters of the collective call at run time is an important step for achieving good performance of MPI applicatio...
Jelena Pjesivac-Grbovic, George Bosilca, Graham E....
APN
2004
Springer
15 years 9 months ago
EMiT: A Process Mining Tool
Process mining offers a way to distill process models from event logs originating from transactional systems in logistics, banking, e-business, health-care, etc. The algorithms us...
Boudewijn F. van Dongen, Wil M. P. van der Aalst