Sciweavers

12194 search results - page 94 / 2439
» cans 2010
Sort
View
FUIN
2010
98views more  FUIN 2010»
13 years 7 months ago
On the Borel Complexity of MSO Definable Sets of Branches
An infinite binary word can be identified with a branch in the full binary tree. We consider sets of branches definable in monadic second-order logic over the tree, where we allow ...
Mikolaj Bojanczyk, Damian Niwinski, Alexander Rabi...
IANDC
2010
121views more  IANDC 2010»
13 years 7 months ago
Curry-Howard for incomplete first-order logic derivations using one-and-a-half level terms
The Curry-Howard correspondence connects derivations in natural deduction with the lambdacalculus. Predicates are types, derivations are terms. This supports reasoning from assump...
Murdoch James Gabbay, Dominic P. Mulligan
IJBIS
2010
123views more  IJBIS 2010»
13 years 7 months ago
Designing information systems requirements in context: insights from the theory of deferred action
This paper considers conceptual and contextual issues relating to the problem of developing systems models capable of representing knowable and unknowable information requirements...
Nandish V. Patel, Ray Hackney
IMCSIT
2010
13 years 7 months ago
Solving a Kind of BVP for ODEs on heterogeneous CPU + CUDA-enabled GPU Systems
The aim of this paper is to show that a special kind of boundary value problem for second-order ordinary differential equations which reduces to the problem of solving a tridiagona...
Przemyslaw Stpiczynski, Joanna Potiopa
IMCSIT
2010
13 years 7 months ago
Selecting the best strategy in a software certification process
In this paper, we propose the use of the pairwise comparisons (PC) method for selection of strategies for software certification. This method can also be used to rank alternative s...
Waldemar W. Koczkodaj, Vova Babiy, Agnieszka D. Bo...