Sciweavers

3910 search results - page 689 / 782
» Analyzing Cross-Connected Networks
Sort
View
COMPULOG
1999
Springer
14 years 3 months ago
Decomposable Constraints
Many constraint satisfaction problems can be naturally and efficiently modelled using non-binary constraints like the “all-different” and “global cardinality” constraints...
Ian P. Gent, Kostas Stergiou, Toby Walsh
LICS
1999
IEEE
14 years 3 months ago
Proving Security Protocols Correct
Security protocols use cryptography to set up private communication channels on an insecure network. Many protocols contain flaws, and because security goals are seldom specified ...
Lawrence C. Paulson
HPCN
1999
Springer
14 years 3 months ago
Data Intensive Distributed Computing; A Medical Application Example
Modern scientific computing involves organizing, moving, visualizing, and analyzing massive amounts of data from around the world, as well as employing large-scale computation. The...
Jason Lee, Brian Tierney, William E. Johnston
DATE
1998
IEEE
103views Hardware» more  DATE 1998»
14 years 3 months ago
Efficient Encoding Schemes for Symbolic Analysis of Petri Nets
Petri nets are a graph-based formalism appropriate to model concurrentsystems such as asynchronouscircuits or network protocols. Symbolic techniques based on Binary Decision Diagr...
Enric Pastor, Jordi Cortadella
HYBRID
1998
Springer
14 years 3 months ago
A Connectionist Simulation of the Empirical Acquisition of Grammatical Relations
Abstract. This paper proposes an account of the acquisition of grammatical relations using the basic concepts of connectionism and a construction-based theory of grammar. Many prev...
William C. Morris, Garrison W. Cottrell, Jeffrey L...