Sciweavers

654 search results - page 100 / 131
» Ordered Sets and Complete Lattices
Sort
View
ENTCS
2008
102views more  ENTCS 2008»
14 years 12 months ago
Soft Linear Logic and Polynomial Complexity Classes
We describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem of second-order linear logic with restricted rules for exponentials, correct and co...
Marco Gaboardi, Jean-Yves Marion, Simona Ronchi De...
IJCSA
2008
82views more  IJCSA 2008»
14 years 11 months ago
Towards an approach to Select an Asset Information Management Strategy
: The management of engineering assets such as facilities and equipments can be a challenging task and optimising their usage is critical. To ensure effective utilization of an ass...
Mohamed-Zied Ouertani, Ajith K. Parlikad, Duncan M...
FTTCS
2006
132views more  FTTCS 2006»
14 years 11 months ago
Algorithms and Data Structures for External Memory
Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast ...
Jeffrey Scott Vitter
JANCL
2007
74views more  JANCL 2007»
14 years 11 months ago
Operations on proofs and labels
Logic of proofs LP introduced by S. Artemov in 1995 describes properties of proof predicate “t is a proof of F” in the propositional language extended by atoms of the form [[t...
Tatiana Yavorskaya, Natalia Rubtsova
JOT
2007
102views more  JOT 2007»
14 years 11 months ago
Type Access Analysis: Towards Informed Interface Design
Programs designed from scratch often start with just a set of classes. Classes can be instantiated and so deliver the objects that are the carriers of information and function. In...
Friedrich Steimann, Philip Mayer