Sciweavers

8699 search results - page 234 / 1740
» Elements of the Theory of Computation
Sort
View
CORR
2011
Springer
160views Education» more  CORR 2011»
15 years 1 months ago
When is social computation better than the sum of its parts?
good solutions to complex problems. In many examples, individuals trying to solve superior global solution. This suggests that there may be general principles of information aggre...
Vadas Gintautas, Aric A. Hagberg, Luís M. A...
ICALP
2005
Springer
16 years 4 days ago
Combining Intruder Theories
Abstract. Most of the decision procedures for symbolic analysis of protocols are limited to a fixed set of algebraic operators associated with a fixed intruder theory. Examples o...
Yannick Chevalier, Michaël Rusinowitch
154
Voted
CORR
2004
Springer
88views Education» more  CORR 2004»
15 years 6 months ago
Unification of Fusion Theories
: Since no fusion theory neither rule fully satisfy all needed applications, the author proposes a Unification of Fusion Theories and a combination of fusion rules in solving probl...
Florentin Smarandache
EJC
2008
15 years 6 months ago
Eriksson's numbers game and finite Coxeter groups
The numbers game is a one-player game played on a finite simple graph with certain "amplitudes" assigned to its edges and with an initial assignment of real numbers to i...
Robert G. Donnelly
CIE
2007
Springer
16 years 24 days ago
Quotients over Minimal Type Theory
Abstract. We consider an extensional version, called qmTT, of the intensional Minimal Type Theory mTT, introduced in a previous paper with G. Sambin, enriched with proof-irrelevanc...
Maria Emilia Maietti