Sciweavers

3653 search results - page 76 / 731
» On Recognizable Timed Languages
Sort
View
JAPLL
2006
90views more  JAPLL 2006»
14 years 9 months ago
Definability and decidability of binary predicates for time granularity
In this paper we study the definability and decidability of binary predicates for time granularity in monadic languages interpreted over finitely and infinitely layered structures...
Massimo Franceschet, Angelo Montanari, Adriano Per...
ECOOPW
1997
Springer
15 years 2 months ago
Design Patterns vs. Language Design
This report investigates the relationships between design patterns and programming languages. A comparison is carried out between the usual track of programming languages developme...
Joseph Gil, David H. Lorenz
ER
2008
Springer
102views Database» more  ER 2008»
14 years 11 months ago
On Temporal Cardinality in the Context of the TOWL Language
The TOWL language is a temporal ontology language built on top of OWL-DL that enables descriptions involving time and temporal aspects such as change and state transitions. Extendi...
Viorel Milea, Michael Mrissa, Kees van der Sluijs,...
SAS
2007
Springer
125views Formal Methods» more  SAS 2007»
15 years 4 months ago
A Compilation Model for Aspect-Oriented Polymorphically Typed Functional Languages
Introducing aspect orientation to a polymorphically typed functional language strengthens the importance of type-scoped advices; i.e., advices with their effects being harnessed b...
Kung Chen, Shu-Chun Weng, Meng Wang, Siau-Cheng Kh...
ICALP
2001
Springer
15 years 2 months ago
On the Approximability of Average Completion Time Scheduling under Precedence Constraints
Abstract. We consider the scheduling problem of minimizing the average weighted job completion time on a single machine under precedence constraints. We show that this problem with...
Gerhard J. Woeginger