Sciweavers

6943 search results - page 786 / 1389
» Representations for evolutionary algorithms
Sort
View
CCS
2006
ACM
15 years 11 months ago
Secure function evaluation with ordered binary decision diagrams
Privacy-preserving protocols allow multiple parties with private inputs to perform joint computation while preserving the privacy of their respective inputs. An important cryptogr...
Louis Kruger, Somesh Jha, Eu-Jin Goh, Dan Boneh
ICML
2009
IEEE
16 years 8 months ago
Learning structurally consistent undirected probabilistic graphical models
In many real-world domains, undirected graphical models such as Markov random fields provide a more natural representation of the dependency structure than directed graphical mode...
Sushmita Roy, Terran Lane, Margaret Werner-Washbur...
FUZZIEEE
2007
IEEE
16 years 1 months ago
Fuzzy Approximation for Convergent Model-Based Reinforcement Learning
— Reinforcement learning (RL) is a learning control paradigm that provides well-understood algorithms with good convergence and consistency properties. Unfortunately, these algor...
Lucian Busoniu, Damien Ernst, Bart De Schutter, Ro...
WIA
2005
Springer
16 years 21 days ago
Minimization of Non-deterministic Automata with Large Alphabets
There has been several attempts over the years to solve the bisimulation minimization problem for finite automata. One of the most famous algorithms is the one suggested by Paige ...
Parosh Aziz Abdulla, Johann Deneux, Lisa Kaati, Ma...
DATE
2000
IEEE
93views Hardware» more  DATE 2000»
15 years 11 months ago
Fast Evaluation of Sequence Pair in Block Placement by Longest Common Subsequence Computation
In [1], Murata et al introduced an elegant representation of block placement called sequence pair. All block placement algorithms which are based on sequence pairs use simulated a...
Xiaoping Tang, D. F. Wong, Ruiqi Tian