6393 search results - page 180 / 1279 » Randomized Algorithms on the Mesh |
100
click to vote
COMBINATORICS
2006
15 years 4 months ago
2006
One way to choose a basis of a matroid at random is to choose an ordering of the ground set uniformly at random and then use the greedy algorithm to find a basis. We investigate t...
145
click to vote
ISAAC
2009
Springer
15 years 10 months ago
2009
Springer
Connected bipartite permutation graphs without vertex labels are investigated. First, the number of connected bipartite permutation graphs of n vertices is given. Based on the num...
141
click to vote
CEC
2005
IEEE
15 years 9 months ago
2005
IEEE
Several approaches have been developed into evolutionary algorithms to deal with dynamic optimization problems, of which memory and random immigrants are two major schemes. This pa...
124
click to vote
INFOCOM
2006
IEEE
15 years 10 months ago
2006
IEEE
— As wavelength-division multiplexing (WDM) evolves towards practical applications in optical transport networks, waveband switching (WBS) has been introduced to cut down the ope...
118
Voted
AMDO
2008
Springer
15 years 6 months ago
2008
Springer
This paper presents a method of interpolating between two or more general displacements (rotation and translation). The resulting interpolated path is smooth and possesses a number...