Sciweavers

1512 search results - page 170 / 303
» When Suboptimal Rules
Sort
View
LICS
2007
IEEE
15 years 5 months ago
Separating DAG-Like and Tree-Like Proof Systems
We show that tree-like (Gentzen’s calculus) PK where all cut formulas have depth at most a constant d does not simulate cut-free PK. Generally, we exhibit a family of sequents t...
Phuong Nguyen
ESORICS
2007
Springer
15 years 5 months ago
Completeness of the Authentication Tests
Protocol participants manipulate values, transforming the cryptographic contexts in which they occur. The rules of the protocol determine which transformations are permitted. We fo...
Shaddin F. Doghmi, Joshua D. Guttman, F. Javier Th...
SEKE
2007
Springer
15 years 5 months ago
A Development Platform for Distributed User Interfaces
Developing user interfaces for a heterogeneous environment is a difficult challenge. Partial distribution of the user interface is an event harder one. Specifically providing de...
Anders Larsson, Magnus Ingmarsson, Bo Sun
IJCNN
2006
IEEE
15 years 5 months ago
A Columnar Competitive Model with Simulated Annealing for Solving Combinatorial Optimization Problems
— One of the major drawbacks of the Hopfield network is that when it is applied to certain polytopes of combinatorial problems, such as the traveling salesman problem (TSP), the...
Eu Jin Teoh, Huajin Tang, Kay Chen Tan
IJCNN
2006
IEEE
15 years 5 months ago
Studies on the Memory Capacity and Robustness of Chaotic Dynamic Neural Networks
- A dynamical neural model that is strongly biologically motivated is applied to learning and retrieving binary patterns. This neural network, known as Freeman’s Ksets, is traine...
Igor Beliaev, Robert Kozma