Sciweavers

3680 search results - page 116 / 736
» cases 2010
Sort
View
ENTCS
2007
107views more  ENTCS 2007»
15 years 6 months ago
Event Domains, Stable Functions and Proof-Nets
We pursue the program of exposing the intrinsic mathematical structure of the “space of proofs” of a logical system [AJ94b]. We study the case of Multiplicative-Additive Linea...
Samson Abramsky
DPD
2002
66views more  DPD 2002»
15 years 6 months ago
A Reference Architecture for the Certification of E-Services in a Digital Government Infrastructure
Certifying the execution of a service is a critical issue for an e-government infrastructure. In fact being able to document that an e-service was actually carried out, given the l...
Franco Arcieri, Giovanna Melideo, Enrico Nardelli,...
ENTCS
2002
77views more  ENTCS 2002»
15 years 6 months ago
The variety of variables in computer-aided real-time programming
The refinement calculus is a well-established theory for translating specifications to program code. Recent research has extended the calculus to handle real-time requirements and...
Luke Wildman, Colin J. Fidge
EOR
2002
80views more  EOR 2002»
15 years 6 months ago
On generalized semi-infinite optimization and bilevel optimization
The paper studies the connections and differences between bilevel problems (BL) and generalized semi-infinite problems (GSIP). Under natural assumptions (GSIP) can be seen as a sp...
Oliver Stein, Georg Still
EOR
2002
105views more  EOR 2002»
15 years 6 months ago
Review of properties of different precedence graphs for scheduling problems
Precedence constraints are a part of a definition of any scheduling problem. After recalling, in precise graph-theoretical terms, the relations between task-on-arc and task-on-nod...
Jacek Blazewicz, Daniel Kobler