5889 search results - page 116 / 1178 » Graph Layout Problems |
129
click to vote
IWANN
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. This paper presents a study in which a new technique for automatically developing Artificial Neural Networks (ANNs) by means of Evolutionary Computation (EC) tools is com...
105
Voted
ICCV
2007
IEEE
16 years 4 months ago
2007
IEEE
We pose robust matching with parametric and non-parametric constraints as the problem of finding a stable independent set (SIS) in an oriented graph whose vertices are all possible...
124
click to vote
LION
2009
Springer
15 years 8 months ago
2009
Springer
A very undesirable behavior of any heuristic algorithm is to be stuck in some specific parts of the search space, in particular in the basins of attraction of the local optima. Wh...
130
click to vote
EOR
2002
15 years 2 months ago
2002
Precedence constraints are a part of a definition of any scheduling problem. After recalling, in precise graph-theoretical terms, the relations between task-on-arc and task-on-nod...
107
click to vote
SDM
2009
SIAM
15 years 11 months ago
2009
SIAM
Consider a 0–1 observation matrix M, where rows correspond to entities and columns correspond to signals; a value of 1 (or 0) in cell (i, j) of M indicates that signal j has bee...