5316 search results - page 110 / 1064 » Which Search Problems Are Random |
114
Voted
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
Markov Networks (also known as Markov Random Fields) have been proposed as a new approach to probabilistic modelling in Estimation of Distribution Algorithms (EDAs). An EDA employ...
116
click to vote
ITSSA
2006
15 years 3 months ago
2006
: Stakeholder search is a general framework for an extension to the improving on the competition approach paradigm for cooperative search that allows for additional individual goal...
146
Voted
GECCO
2005
Springer
15 years 8 months ago
2005
Springer
Among the many codings of spanning trees for evolutionary search are those based on bijections between Pr¨ufer strings—strings of n−2 vertex labels—and spanning trees on th...
123
Voted
IJCAI
1989
15 years 4 months ago
1989
This paper presents an evaluation of two orthogonal schemes for improving the efficiency of solving constraint satisfaction problems (CSPs). The first scheme involves a class of p...
144
Voted
JSAC
2008
15 years 3 months ago
2008
Suppose we have a directed graph G with set of nodes V = {1, . . . , N} and a measure xi for every node i V . The average consensus problem consists in computing the average xA = ...