Sciweavers

3204 search results - page 404 / 641
» The Alcuin Number of a Graph
Sort
View
JCT
2007
111views more  JCT 2007»
15 years 6 months ago
Lattice point counts for the Shi arrangement and other affinographic hyperplane arrangements
Hyperplanes of the form xj = xi + c are called affinographic. For an affinographic hyperplane arrangement in Rn, such as the Shi arrangement, we study the function f(m) that counts...
David Forge, Thomas Zaslavsky
213
Voted
GECCO
2010
Springer
218views Optimization» more  GECCO 2010»
15 years 11 months ago
Cartesian genetic programming
This paper presents a new form of Genetic Programming called Cartesian Genetic Programming in which a program is represented as an indexed graph. The graph is encoded in the form o...
Julian Francis Miller, Simon L. Harding
183
Voted
CORR
2010
Springer
112views Education» more  CORR 2010»
15 years 7 months ago
On Finding Frequent Patterns in Event Sequences
Given a directed acyclic graph with labeled vertices, we consider the problem of finding the most common label sequences ("traces") among all paths in the graph (of some...
Andrea Campagna, Rasmus Pagh
162
Voted
DM
2008
103views more  DM 2008»
15 years 7 months ago
Edge-colorings avoiding rainbow and monochromatic subgraphs
For two graphs G and H, let the mixed anti-Ramsey numbers, maxR(n; G, H), (minR(n; G, H)) be the maximum (minimum) number of colors used in an edge-coloring of a complete graph wi...
Maria Axenovich, Perry Iverson
175
Voted
GECCO
2000
Springer
145views Optimization» more  GECCO 2000»
15 years 10 months ago
A New Genetic Algorithm for Minimum Span Frequency Assignment using Permutation and Clique
We propose a new Genetic Algorithm (GA) for solving the minimum span frequency assignment problem (MSFAP). The MSFAP is minimizing the range of the frequencies assigned to each tr...
Shouichi Matsui, Ken-ichi Tokoro