Sciweavers

1663 search results - page 199 / 333
» Compositional Service Trees
Sort
View
AAAI
2008
15 years 8 months ago
Efficient Learning of Action Schemas and Web-Service Descriptions
This work addresses the problem of efficiently learning action schemas using a bounded number of samples (interactions with the environment). We consider schemas in two languages-...
Thomas J. Walsh, Michael L. Littman
VLDB
2002
ACM
125views Database» more  VLDB 2002»
15 years 6 months ago
Self-tuning Database Technology and Information Services: from Wishful Thinking to Viable Engineering
Automatic tuning has been an elusive goal for database technology for a long time and is becoming a pressing issue for modern E-services. This paper reviews and assesses the advan...
Gerhard Weikum, Axel Mönkeberg, Christof Hass...
ACL
2010
15 years 4 months ago
Efficient Inference through Cascades of Weighted Tree Transducers
Weighted tree transducers have been proposed as useful formal models for representing syntactic natural language processing applications, but there has been little description of ...
Jonathan May, Kevin Knight, Heiko Vogler
SCS
2003
15 years 7 months ago
A New Component Concept for Fault Trees
The decomposition of complex systems into manageable parts is an essential principle when dealing with complex technical systems. However, many safety and reliability modelling te...
Bernhard Kaiser, Peter Liggesmeyer, Oliver Mä...
FMOODS
2008
15 years 7 months ago
Behavioural Theory at Work: Program Transformations in a Service-Centred Calculus
We analyse the relationship between object-oriented modelling and session-based, service-oriented modelling, starting from a typical UML Sequence Diagram and providing a program tr...
Luís Cruz-Filipe, Ivan Lanese, Francisco Ma...