Sciweavers

3267 search results - page 314 / 654
» Generalized quasirandom graphs
Sort
View
PUK
2003
15 years 8 months ago
Accelerating Heuristic Search in Spatial Domains
This paper exploits the spatial representation of state space problem graphs to preprocess and enhance heuristic search engines. It combines classical AI exploration with computati...
Stefan Edelkamp, Shahid Jabbar, Thomas Willhalm
SIROCCO
1997
15 years 8 months ago
Static Frequency Assignment in Cellular Networks
A cellular network is generally modeled as a subgraph of the triangular lattice. In the static frequency assignment problem, each vertex of the graph is a base station in the netw...
Lata Narayanan, Sunil M. Shende
SODA
1996
ACM
95views Algorithms» more  SODA 1996»
15 years 8 months ago
RNC Algorithms for the Uniform Generation of Combinatorial Structures
We describe several RNC algorithms for generating graphs and subgraphs uniformly at random. For example, unlabelled undirected graphs are generated in O(lg3 n) time using O n2 lg3...
Michele Zito, Ida Pu, Martyn Amos, Alan Gibbons
GECCO
2008
Springer
141views Optimization» more  GECCO 2008»
15 years 7 months ago
A study of NK landscapes' basins and local optima networks
We propose a network characterization of combinatorial fitness landscapes by adapting the notion of inherent networks proposed for energy surfaces [5]. We use the well-known fami...
Gabriela Ochoa, Marco Tomassini, Sébastien ...
GECCO
2008
Springer
122views Optimization» more  GECCO 2008»
15 years 7 months ago
Varying portfolio construction of stocks using genetic network programming with control nodes
A new evolutionary method named “Genetic Network Programming with Control Nodes, GNPcn” has been proposed and applied to determine the timing of buying and selling stocks. GNP...
Etsushi Ohkawa, Yan Chen, Shingo Mabu, Kaoru Shima...