Sciweavers

1989 search results - page 98 / 398
» Set functions for functional logic programming
Sort
View
ENTCS
2010
130views more  ENTCS 2010»
13 years 11 months ago
Compositional System Security with Interface-Confined Adversaries
This paper presents a formal framework for compositional reasoning about secure systems. A key insight is to view a trusted system in terms of the interfaces that the various comp...
Deepak Garg, Jason Franklin, Dilsun Kirli Kaynar, ...
ASPLOS
1987
ACM
14 years 2 months ago
The Effect of Instruction Set Complexity on Program Size and Memory Performance
One potentialdisadvantage of a machine with a reduced instruction. set is that object programs may be substantially larger than those for a machine with a richer, more complex ins...
Jack W. Davidson, Richard A. Vaughan
CEC
2011
IEEE
12 years 10 months ago
Cost-benefit analysis of using heuristics in ACGP
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
John W. Aleshunas, Cezary Z. Janikow
APNOMS
2006
Springer
14 years 2 months ago
Proposal of Operation Method for Application Servers on NGN Using Unified Management Environment
Abstract. The Next Generation Network (NGN) has a multilayer logical construction. Network carriers use various tools in complex procedures to operate application servers on the NG...
Atsushi Yoshida, Yu Miyoshi, Yoshihiro Otsuka
CORR
2006
Springer
153views Education» more  CORR 2006»
13 years 10 months ago
Genetic Programming, Validation Sets, and Parsimony Pressure
Fitness functions based on test cases are very common in Genetic Programming (GP). This process can be assimilated to a learning task, with the inference of models from a limited n...
Christian Gagné, Marc Schoenauer, Marc Pari...