16626 search results - page 345 / 3326 » Computing is a natural science |
147
click to vote
ERSHOV
2006
Springer
15 years 8 months ago
2006
Springer
We improve the decision procedure from [10] for the problem of generalized soundness of workflow nets. A workflow net is generalized sound iff every marking reachable from an initi...
163
click to vote
CSR
2008
Springer
15 years 8 months ago
2008
Springer
Razborov and Rudich identified an imposing barrier that stands in the way of progress toward the goal of proving superpolynomial lower bounds on circuit size. Their work on "n...
192
click to vote
CSR
2008
Springer
15 years 7 months ago
2008
Springer
An (n, k)-ary quantifier is a generalized logical connective, binding k variables and connecting n formulas. Canonical systems with (n, k)-ary quantifiers form a natural class of G...
167
click to vote
CAD
2006
Springer
15 years 6 months ago
2006
Springer
A proper segmentation of pen marking enhances shape recognition and enables a natural interface for sketch-based modeling from simple line drawing tools to 3D solid modeling appli...
175
click to vote
ENTCS
2006
15 years 6 months ago
2006
It is common practice in both theoretical computer science and theoretical physics to describe the (static) logic of a system by means of a complete lattice. When formalizing the d...