Sciweavers

344 search results - page 54 / 69
» Some Theorems We Should Prove
Sort
View
LICS
2002
IEEE
14 years 8 days ago
Little Engines of Proof
The automated construction of mathematical proof is a basic activity in computing. Since the dawn of the field of automated reasoning, there have been two divergent schools of tho...
Natarajan Shankar
CORR
2006
Springer
108views Education» more  CORR 2006»
13 years 7 months ago
Two polygraphic presentations of Petri nets
: This document gives an algebraic and two polygraphic translations of Petri nets, all three providing an easier way to describe reductions and to identify some of them. The first ...
Yves Guiraud
CRYPTO
2012
Springer
268views Cryptology» more  CRYPTO 2012»
11 years 9 months ago
Secret Sharing Schemes for Very Dense Graphs
A secret-sharing scheme realizes a graph if every two vertices connected by an edge can reconstruct the secret while every independent set in the graph does not get any informatio...
Amos Beimel, Oriol Farràs, Yuval Mintz
EKNOW
2009
13 years 5 months ago
Visual Middle-Out Modeling of Problem Spaces
Modeling is a complex and central activity in many domains. Domain experts and designers usually work by drawing and create models from the middle-out; however, visual and middle-...
Andrea Valente
ATMOS
2009
13 years 8 months ago
Delay Management with Re-Routing of Passengers
Trains often arrive delayed at stations where passengers have to change to other trains. The question of delay management is whether these trains should wait for the original train...
Twan Dollevoet, Dennis Huisman, Marie Schmidt, Ani...