1871 search results - page 86 / 375 » The Ephemeral Pairing Problem |
IWPEC
2009
Springer
15 years 5 months ago
2009
Springer
We study the Hospitals/Residents with Couples problem, a variant of the classical Stable Marriage problem. This is the extension of the Hospitals/Residents problem where residents ...
OPODIS
2007
15 years 19 days ago
2007
Abstract. We consider the distributed construction of a minimum weight 2edge-connected spanning subgraph (2-ECSS) of a given weighted or unweighted graph. A 2-ECSS of a graph is a ...
126
click to vote
COCOON
2010
Springer
14 years 9 months ago
2010
Springer
The problem of sorting permutations by double-cut-and-joins (SBD) arises when we perform the double-cut-and-join (DCJ) operations on pairs of unichromosomal genomes without the gen...
ICRA
2002
IEEE
15 years 4 months ago
2002
IEEE
A new extremal distance tracking algorithm is presented for parametric curves and surfaces undergoing rigid body motion. The essentially geometric extremization problem is transfo...
AI
2007
Springer
14 years 11 months ago
2007
Springer
We present an efficient algorithm that checks the consistency of partial descriptions of ordered trees. The constraint language of these descriptions was introduced by Cornell in c...