697 search results - page 22 / 140 » A Study of Evaluation Functions for the Graph K-Coloring Pro... |
AUSAI
2005
Springer
14 years 1 months ago
2005
Springer
This paper considers the use of randomly generated directed graphs as neighborhoods for particle swarm optimizers (PSO) using fully informed particles (FIPS), together with dynamic...
CIAC
2010
Springer
14 years 14 days ago
2010
Springer
For a given node t in a directed graph G(VG, EG) and a positive integer k we study the problem of computing a set of k new links pointing to t – so called backlinks to t – prod...
JCT
2007
13 years 7 months ago
2007
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...
SODA
1998
ACM
13 years 9 months ago
1998
ACM
We introduce a new set of probabilistic analysis tools based on the analysis of And-Or trees with random inputs. These tools provide a unifying, intuitive, and powerful framework ...
ICDM
2008
IEEE
14 years 2 months ago
2008
IEEE
In this work, we study a visual data mining problem: Given a set of discovered overlapping submatrices of interest, how can we order the rows and columns of the data matrix to bes...