Sciweavers

11381 search results - page 323 / 2277
» Connectivity
Sort
View
GECCO
2000
Springer
113views Optimization» more  GECCO 2000»
15 years 10 months ago
A Non-Linear Schema Theorem for Genetic Algorithms
We generalize Holland's Schema Theorem to the setting that genes are arranged, not necessarily in a linear sequence, but as the nodes in a connected graph. We have experiment...
William A. Greene
CCCG
2007
15 years 8 months ago
The Ordinary Line Problem Revisited
Let P be a set of n points in the plane. A connecting line of P is a line that passes through at least two of its points. A connecting line is called ordinary if it is incident on...
Asish Mukhopadhyay, Eugene Greene
DLOG
2003
15 years 8 months ago
Rule Based Computation of Updates to Terminologies
In this paper we formalise compilation of the conjunctive bodies of a restricted class of Horn rules into updates on terminologies. This involves a pre-processing of the graphs re...
Sanjay Modgil
CORR
2010
Springer
59views Education» more  CORR 2010»
15 years 6 months ago
Edge Growth in Graph Cubes
We show that for every connected graph G of diameter 3, the graph G3 has average degree 7 4 (G). We also provide an example showing that this bound is best possible. This resolv...
Matt DeVos, Stéphan Thomassé
CORR
2008
Springer
61views Education» more  CORR 2008»
15 years 6 months ago
Short proofs of strong normalization
This paper presents simple, syntactic strong normalization proofs for the simply-typed -calculus and the polymorphic -calculus (system F) with the full set of logical connectives, ...
Aleksander Wojdyga