1857 search results - page 73 / 372 » Minimum Degree Orderings |
147
click to vote
GECCO
2004
Springer
15 years 11 months ago
2004
Springer
A genetic algorithm has been developed in order to find the global minimum of platinum-palladium nanoalloy clusters. The effect of biasing the initial population and predating sp...
140
click to vote
WG
2004
Springer
15 years 11 months ago
2004
Springer
Let be the following strategy to construct a walk in a labeled digraph: at each vertex, we follow the unvisited arc of minimum label. In this work we study for which languages, app...
189
click to vote
PAMI
2010
15 years 4 months ago
2010
— In the last decade, graph-cut optimization has been popular for a variety of labeling problems. Typically graph-cut methods are used to incorporate smoothness constraints on a ...
195
click to vote
EOR
2007
15 years 6 months ago
2007
This paper explores the application of ordered weighted averaging (OWA) operators to develop water quality index, which incorporates an attitudinal dimension in the aggregation pr...
149
click to vote
NETWORKS
2002
15 years 6 months ago
2002
The conditional diameter D of a digraph G measures how far apart a pair of vertex sets V1 and V2 can be in such a way that the minimum out-degree and the minimum in-degree of the ...