Sciweavers

3379 search results - page 30 / 676
» Combinators for Interaction Nets
Sort
View
CSL
2005
Springer
14 years 3 months ago
L-Nets, Strategies and Proof-Nets
We consider the setting of L-nets, recently introduced by Faggian and Maurel as a game model of concurrent interaction and based on Girard’s Ludics. We show how L-nets satisfying...
Pierre-Louis Curien, Claudia Faggian
CONCUR
1995
Springer
14 years 1 months ago
Characterizing Behavioural Congruences for Petri Nets
Abstract. We exploit a notion of interface for Petri nets in order to design a set of net combinators. For such a calculus of nets, we focus on the behavioural congruences arising ...
Mogens Nielsen, Lutz Priese, Vladimiro Sassone
VTS
1999
IEEE
81views Hardware» more  VTS 1999»
14 years 1 months ago
Simulation-Based Design Error Diagnosis and Correction in Combinational Digital Circuits
This paper describes an approach to design error diagnosis and correction in combinational digital circuits. Our approach targets small errors introduced during the design process...
Debashis Nayak, D. M. H. Walker
IJCAI
2003
13 years 11 months ago
Combining Two Local Search Approaches to Hypergraph Partitioning
We study leading-edge local search heuristics for balanced hypergraph partitioning and Boolean satisfiability, intending the generalization of such heuristics beyond their origina...
Arathi Ramani, Igor L. Markov
NAACL
2003
13 years 11 months ago
Unsupervised methods for developing taxonomies by combining syntactic and statistical information
This paper describes an unsupervised algorithm for placing unknown words into a taxonomy and evaluates its accuracy on a large and varied sample of words. The algorithm works by ï...
Dominic Widdows