Sciweavers

2834 search results - page 124 / 567
» Representing Trees with Constraints
Sort
View
PPSN
2004
Springer
15 years 3 months ago
Learning Probabilistic Tree Grammars for Genetic Programming
Genetic Programming (GP) provides evolutionary methods for problems with tree representations. A recent development in Genetic Algorithms (GAs) has led to principled algorithms cal...
Peter A. N. Bosman, Edwin D. de Jong
AAAI
2008
15 years 9 days ago
Latent Tree Models and Approximate Inference in Bayesian Networks
We propose a novel method for approximate inference in Bayesian networks (BNs). The idea is to sample data from a BN, learn a latent tree model (LTM) from the data offline, and wh...
Yi Wang, Nevin Lianwen Zhang, Tao Chen
ASM
2010
ASM
15 years 7 months ago
Lightweight Modeling of Java Virtual Machine Security Constraints
The Java programming language has been widely described as secure by design. Nevertheless, a number of serious security vulnerabilities have been discovered in Java, particularly i...
Mark C. Reynolds
ATAL
2007
Springer
15 years 4 months ago
Constraint satisfaction algorithms for graphical games
We formulate the problem of computing equilibria in multiplayer games represented by arbitrary undirected graphs as a constraint satisfaction problem and present two algorithms. T...
Vishal Soni, Satinder P. Singh, Michael P. Wellman
DATE
1997
IEEE
75views Hardware» more  DATE 1997»
15 years 2 months ago
Using constraint logic programming in memory synthesis for general purpose computers
In modern computer systems the performance is dominated by the memory performance. Currently, there is neither a systematic design methodology nor a tool for the design of memory ...
Renate Beckmann, Jürgen Herrmann