Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,733,653 papers from all fields of science
Search
Sign In
Create Free Account
Schema (genetic algorithms)
Known as:
Schema (genetic programming)
, Schema
, Propagation
Expand
A schema is a template in computer science used in the field of genetic algorithms that identifies a subset of strings with similarities at certain…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
7 relations
Computer science
Defining length
Effective fitness
Genetic algorithm
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Segmentation with Selectively Propagated Constraints
Peng Han
,
Guangzhen Liu
,
Song-Fang Huang
,
Wenwu Yuan
,
Zhiwu Lu
International Conference on Neural Information…
2016
Corpus ID: 39050890
This paper presents a novel selective constraint propagation method for constrained image segmentation. In the literature, many…
Expand
2014
2014
A Fast Clustering Based Feature Subset Selection Using Affinity Propagation Algorithm
M. S. Kumar
,
Latha Jothi
2014
Corpus ID: 17893665
Clustering which tries to group a set of points into clusters such that points in the same cluster are more similar to each other…
Expand
2011
2011
The Analysis and Valuation of Disruption
D. Nelson
2011
Corpus ID: 111246548
2011
2011
Bribery in Path-Disruption Games
Anja Rey
,
J. Rothe
Algorithmic Decision Theory
2011
Corpus ID: 11795640
Bachrach and Porat [1] introduced path-disruption games. In these coalitional games, agents are placed on the vertices of a graph…
Expand
2009
2009
High Performance Non-Binary Quasi-Cyclic LDPC Codes on Euclidean Geometries LDPC Codes on Euclidean Geometries
Bo Zhou
,
Jingyu Kang
,
Ying-Yu Tai
,
Shu Lin
,
Z. Ding
IEEE Transactions on Communications
2009
Corpus ID: 6617090
This paper presents algebraic methods for constructing high performance and efficiently encodable non-binary quasi-cyclic LDPC…
Expand
2008
2008
Two Encodings of DNNF Theories
J. C. Jung
,
P. Barahona
,
G. Katsirelos
,
T. Walsh
2008
Corpus ID: 14668404
The paper presents two new compilation schemes of Decomposable Negation Normal Form (DNNF) theories into Conjunctive Normal Form…
Expand
2007
2007
A Cerebral Cortex Model that Self-Organizes Conditional Probability Tables and Executes Belief Propagation
Yuuji Ichisugi
International Joint Conference on Neural Networks
2007
Corpus ID: 16848701
This paper describes a neural network model of cerebral cortex, BESOM model, that acquires conditional probability tables for a…
Expand
2005
2005
Geometric Algorithm for Received Signal Strength Based Mobile Positioning
P. Brída
2005
Corpus ID: 17484729
Mobile positioning is one of the fastest growing areas for the development of new technologies, services and applications. This…
Expand
2003
2003
Generation of Random Bayesian Networks with Constraints on Induced Width , with Application to the Average Analysis of d-Connectivity , Quasi-random Sampling , and Loopy Propagation
J. Ide
,
Fabio Gagliardi Cozman
,
F. Ramos
2003
Corpus ID: 13595371
We present algorithms for the generation of uniformly distributed Bayesian networks with constraints on induced width. The…
Expand
1995
1995
A Marker Propagation Algorithm for Text Coherence
S. Harabagiu
,
D. Moldovan
1995
Corpus ID: 8889357
Text coherence is a di cult problem in natural language processing A text is considered to be coherent when sentences follow…
Expand