Sciweavers

1653 search results - page 209 / 331
» Computer science and game theory
Sort
View
81
Voted
RTA
1993
Springer
15 years 3 months ago
Bi-rewriting, a Term Rewriting Technique for Monotonic Order Relations
We propose an extension of rewriting techniques to derive inclusion relations a ⊆ b between terms built from monotonic operators. Instead of using only a rewriting relation ⊆ â...
Jordi Levy, Jaume Agustí-Cullell
87
Voted
DIS
2006
Springer
15 years 2 months ago
Symmetric Item Set Mining Based on Zero-Suppressed BDDs
In this paper, we propose a method for discovering hidden information from large-scale item set data based on the symmetry of items. Symmetry is a fundamental concept in the theory...
Shin-ichi Minato
92
Voted
ACSC
2000
IEEE
15 years 2 months ago
Object-Oriented Natural Language Requirements Specification
A methodology is proposed for the formal development of software systems from a user's requirements specification in natural language into a complete implementation, proceedi...
Barrett R. Bryant
71
Voted
CSR
2008
Springer
15 years 22 days ago
Cracks in the Defenses: Scouting Out Approaches on Circuit Lower Bounds
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...
Eric Allender
83
Voted
GG
2008
Springer
15 years 8 hour ago
Parallel and Sequential Independence for Borrowed Contexts
Parallel and sequential independence are central concepts in the concurrency theory of the double pushout (dpo) approach to graph rewriting. However, so far those same notions were...
Filippo Bonchi, Fabio Gadducci, Tobias Heindel