Sciweavers

555 search results - page 46 / 111
» Complexity of Operations on Cofinite Languages
Sort
View
ECOOP
2009
Springer
14 years 8 months ago
Stepping Stones over the Refactoring Rubicon
Refactoring tools allow the programmer to pretend they are working with a richer language where the behaviour of a program is automatically preserved during restructuring. In this ...
Mathieu Verbaere, Max Schäfer, Oege de Moor, ...
AGENTS
1997
Springer
13 years 11 months ago
TAIPE: Tactical Assistants for Interaction Planning and Execution
Downsizing the number of operators controlling complex systems can increase the decision-making demands on remaining operators, particularly in crisis situations. An answer to thi...
Edmund H. Durfee, Marcus J. Huber, Michael Kurnow,...
SARA
2005
Springer
14 years 1 months ago
Learning Regular Expressions from Noisy Sequences
Abstract. The presence of long gaps dramatically increases the difficulty of detecting and characterizing complex events hidden in long sequences. In order to cope with this proble...
Ugo Galassi, Attilio Giordana
EUROMICRO
1999
IEEE
13 years 12 months ago
Software Synthesis for System Level Design Using Process Execution Trees
Software synthesis for system level design languages becomes feasible because the current technology, pricing and application trends will most likely alleviate the industrial empha...
Leo J. van Bokhoven, Jeroen Voeten, Marc Geilen
ICDT
1999
ACM
133views Database» more  ICDT 1999»
13 years 12 months ago
A Framework for the Investigation of Aggregate Functions in Database Queries
Abstract. In this paper we present a new approach for studying aggregations in the context of database query languages. Starting from a broad de nition of aggregate function, we ad...
Luca Cabibbo, Riccardo Torlone