Sciweavers

3653 search results - page 49 / 731
» On Recognizable Timed Languages
Sort
View
IFIP
1997
Springer
15 years 1 months ago
Waiting time distributions in a two-queue model with mixed exhaustive and gated-type K-limited services
We deal with a two-queue model with mixed exhaustive and gated-type K-limited services. This model can achieve various degrees of priority in each queue by varying the value of K....
Toshihisa Ozawa
ASPLOS
1994
ACM
15 years 1 months ago
Software Overhead in Messaging Layers: Where Does the Time Go?
Despite improvements in network interfaces and software messaging layers, software communication overhead still dominates the hardware routing cost in most systems. In this study,...
Vijay Karamcheti, Andrew A. Chien
MOMPES
2006
IEEE
15 years 3 months ago
Model-Driven Development of Real-Time Systems with UML 2.0 and C
In this era of intense liking to automation in almost all time-critical fields, real-time systems have got widespread utilization in industrial, commercial, medical, space and mil...
Mohammad Ullah Khan, Kurt Geihs, Felix Gutbrodt, P...
ICFP
2002
ACM
15 years 9 months ago
Packrat parsing: : simple, powerful, lazy, linear time, functional pearl
Packrat parsing is a novel technique for implementing parsers in a lazy functional programming language. A packrat parser provides the power and flexibility of top-down parsing wi...
Bryan Ford
CSR
2007
Springer
15 years 4 months ago
Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen