1871 search results - page 43 / 375 » The Ephemeral Pairing Problem |
79
Voted
ICTCS
2005
Springer
15 years 4 months ago
2005
Springer
This paper concerns the Lateral Gene Transfer Problem. This minimization problem, defined by Hallet and Lagergren [6], is that of finding the most parsimonious lateral gene trans...
DAM
2007
14 years 11 months ago
2007
In this paper, we prove that the harmonious coloring problem is NP-complete for connected interval and permutation graphs. Given a simple graph G, a harmonious coloring of G is a ...
SOFSEM
2007
Springer
15 years 5 months ago
2007
Springer
We study two aspects of a generalization of the Tower of Hanoi puzzle. In 1981, D. Wood suggested its variant, where a bigger disk may be placed higher than a smaller one if their ...
77
Voted
ICALT
2003
IEEE
15 years 4 months ago
2003
IEEE
It is believed that computer-supported collaboration at a distance can stimulate learning. In this paper an innovative environment that permits real-time collaborative problem sol...
94
Voted
ICDAR
2003
IEEE
15 years 4 months ago
2003
IEEE
This paper proposes a binary classification tree aiming at solving multi-class classification problems using binary classifiers. The tree design is achieved in a way that a class ...