Sciweavers

10072 search results - page 373 / 2015
» Composition of Model Programs
Sort
View
CORR
2007
Springer
82views Education» more  CORR 2007»
15 years 6 months ago
Programs as polygraphs: computability and complexity
Abstract – This study presents Albert Burroni’s polygraphs as an algebraic and graphical description of first-order functional programs, where functions can have many outputs....
Guillaume Bonfante, Yves Guiraud
GCB
1997
Springer
74views Biometrics» more  GCB 1997»
15 years 11 months ago
Using constraint programming for lattice protein folding
We present a global search technique for nding the global minimal conformation of a sequence in Dill's HP-lattice model5;6 . The HP-lattice model is a simpli ed model of prot...
Rolf Backofen
WSC
2007
15 years 9 months ago
The optimizing-simulator: merging simulation and optimization using approximate dynamic programming
There has long been a competition between simulation and optimization in the modeling of problems in transportation and logistics, machine scheduling and similar highdimensional p...
Warren B. Powell
CSFW
2008
IEEE
16 years 1 months ago
Joint State Theorems for Public-Key Encryption and Digital Signature Functionalities with Local Computation
Composition theorems in simulation-based approaches allow to build complex protocols from sub-protocols in a modular way. However, as first pointed out and studied by Canetti and ...
Ralf Küsters, Max Tuengerthal
APSEC
2000
IEEE
15 years 11 months ago
Enterprise modeling using class and instance models
Current object-oriented formalisms, such as UML, focus on describing class models and use instance models only for depicting scenarios. Little attention is being devoted to defini...
Rakesh Agarwal, Giorgio Bruno, Marco Torchiano