1749 search results - page 158 / 350 » Conditional colorings of graphs |
173
click to vote
PUK
2000
15 years 8 months ago
2000
In this paper we discuss and describe preliminary results of integrating two strands of planning research - that of using plan graphs to speed up planning, and that of using object...
141
click to vote
ECEASST
2008
15 years 6 months ago
2008
Abstract: A triangulated network of mobile units is modelled by means of a graph transformation system in which graph nodes are labelled with geometric coordinates and edges are la...
122
Voted
COMBINATORICS
2007
15 years 6 months ago
2007
The density matrix of a graph is the combinatorial laplacian matrix of a graph normalized to have unit trace. In this paper we generalize the entanglement properties of mixed dens...
159
click to vote
RSA
2010
15 years 1 months ago
2010
We show that asymptotic equivalence, in a strong form, holds between two random graph models with slightly differing edge probabilities under substantially weaker conditions than w...
169
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
Hyper-heuristics can be thought of as “heuristics to choose heuristics”. They are concerned with adaptively finding solution methods, rather than directly producing a solutio...