326 search results - page 4 / 66 » Algorithms for Pattern Involvement in Permutations |
IWOCA
2009
Springer
14 years 4 months ago
2009
Springer
A vertex subset D of a graph G is a dominating set if every vertex of G is either in D or is adjacent to a vertex in D. The paired-domination problem on G asks for a minimum-cardi...
GECCO
2004
Springer
14 years 3 months ago
2004
Springer
Permutations of vertices can represent constrained spanning trees for evolutionary search via a decoder based on Prim’s algorithm, and random keys can represent permutations. Tho...
INFOCOM
2002
IEEE
14 years 2 months ago
2002
IEEE
— Optical Burst Switching (OBS) is an experimental network technology that enables the construction of very high capacity routers, using optical data paths and electronic control...
CIARP
2009
Springer
14 years 1 months ago
2009
Springer
A large number of computer tasks can be modeled as the search for an object near a given query. From multimedia databases to learning algorithms, data mining and pattern recognitio...
CPM
2009
Springer
14 years 4 months ago
2009
Springer
A sequence of reversals that takes a signed permutation to the identity is perfect if it preserves all common intervals between the permutation and the identity. The problem of com...