Sciweavers

3190 search results - page 94 / 638
» cans 2011
Sort
View
111
Voted
ENTCS
2011
106views more  ENTCS 2011»
14 years 7 months ago
A Flexible Framework for Visualisation of Computational Properties of General Explicit Substitutions Calculi
SUBSEXPL is a system originally developed to visualise reductions, simplifications and normalisations in three important calculi of explicit substitutions and has been applied to...
F. L. C. de Moura, A. V. Barbosa, Mauricio Ayala-R...
108
Voted
ENTCS
2011
99views more  ENTCS 2011»
14 years 7 months ago
Symmetry and Composition in Probabilistic Theories
The past decade has seen a remarkable resurgence of the old programme of finding more or less a priori axioms for the mathematical framework of quantum mechanics. The new impetus...
Alexander Wilce
107
Voted
ENTCS
2011
131views more  ENTCS 2011»
14 years 7 months ago
Computational Complexity in Non-Turing Models of Computation: The What, the Why and the How
We preliminarily recap what is meant by complexity and non-Turing computation, by way of explanation of our title, ‘Computational Complexity in Non-Turing Models of Computation...
Ed Blakey
115
Voted
EOR
2011
113views more  EOR 2011»
14 years 7 months ago
A relation-algebraic approach to simple games
Simple games are a powerful tool to analyze decision-making and coalition formation in social and political life. In this paper, we present relation-algebraic models of simple game...
Rudolf Berghammer, Stefan Bolus, Agnieszka Rusinow...
EOR
2011
85views more  EOR 2011»
14 years 7 months ago
Optimizing departure times in vehicle routes
Most solution methods for the vehicle routing problem with time windows (VRPTW) develop routes from the earliest feasible departure time. In practice, however, temporal traffic co...
A. L. Kok, E. W. Hans, J. M. J. Schutten