Sciweavers

784 search results - page 92 / 157
» Relaxing the Value Restriction
Sort
View
COORDINATION
2008
Springer
13 years 11 months ago
How to Infer Finite Session Types in a Calculus of Services and Sessions
Abstract. The notion of session is fundamental in service oriented applications, as it separates interactions between different instances of the same service, and it groups togethe...
Leonardo Gaetano Mezzina
ICISC
2007
120views Cryptology» more  ICISC 2007»
13 years 10 months ago
A Note About the Traceability Properties of Linear Codes
We characterize the traceability properties of linear codes. It is well known that any code of length n and minimum distance d is a c-TA code if c2 < n/(n−d). In this paper, w...
Marcel Fernandez, Josep Cotrina Navau, Miguel Sori...
WSC
2004
13 years 10 months ago
A New Method to Determine the Tool Count of a Semiconductor Factory Using FabSim
Tool count optimization is mandatory for an efficiently organized semiconductor factory. This paper describes an efficient heuristic to determine the tool count using the compact ...
Holger Vogt
IJCAI
1997
13 years 10 months ago
Law Discovery using Neural Networks
This paper proposes a new connectionist approach to numeric law discovery; i.e., neural networks (law-candidates) are trained by using a newly invented second-order learning algor...
Kazumi Saito, Ryohei Nakano
SODA
2000
ACM
83views Algorithms» more  SODA 2000»
13 years 10 months ago
Restructuring ordered binary trees
We consider the problem of restructuring an ordered binary tree T , preserving the in-order sequence of its nodes, so as to reduce its height to some target value h. Such a restru...
William S. Evans, David G. Kirkpatrick