Sciweavers

534 search results - page 61 / 107
» Proving Termination of Rewrite Systems Using Bounds
Sort
View
ENTCS
2007
158views more  ENTCS 2007»
13 years 8 months ago
Abstraction and Completeness for Real-Time Maude
ion and Completeness for Real-Time Maude Peter Csaba ¨Olveczky a,b and Jos´e Meseguer b a Department of Informatics, University of Oslo b Department of Computer Science, Universi...
Peter Csaba Ölveczky, José Meseguer
ECRTS
2007
IEEE
14 years 3 months ago
On Controllability and Feasibility of Utilization Control in Distributed Real-Time Systems
Feedback control techniques have recently been applied to a variety of real-time systems. However, a fundamental issue that was left out is guaranteeing system controllability and...
Xiaorui Wang, Yingming Chen, Chenyang Lu, Xenofon ...
IPPS
2002
IEEE
14 years 1 months ago
Achieving Scalability in Parallel Tabled Logic Programs
Tabling or memoing is a technique where one stores intermediate answers to a problem so that they can be reused in further calls. Tabling is of interest to logic programming becau...
Ricardo Rocha, Fernando M. A. Silva, Vítor ...
LREC
2010
160views Education» more  LREC 2010»
13 years 10 months ago
FrAG, a Hybrid Constraint Grammar Parser for French
This paper describes a hybrid tagger/parser for French (FrAG), and presents results from ongoing development work, corpus annotation and evaluation. The core of the system is a se...
Eckhard Bick
FSTTCS
2009
Springer
14 years 3 months ago
Donation Center Location Problem
We introduce and study the donation center location problem, which has an additional application in network testing and may also be of independent interest as a general graph-theor...
Chien-Chung Huang, Zoya Svitkina