10392 search results - page 1789 / 2079 » Introduction to Computer Science |
190
click to vote
MFCS
2005
Springer
16 years 4 days ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
170
click to vote
MFCS
2005
Springer
16 years 4 days ago
2005
Springer
Abstract. Given a distance matrix M that specifies the pairwise evolutionary distances between n species, the phylogenetic tree reconstruction problem asks for an edge-weighted ph...
157
click to vote
MFCS
2005
Springer
16 years 4 days ago
2005
Springer
We investigate the complexity of finding prime implicants and minimal equivalent DNFs for Boolean formulas, and of testing equivalence and isomorphism of monotone formulas. For DN...
191
click to vote
MICAI
2005
Springer
16 years 4 days ago
2005
Springer
A powerful and useful approach for modeling knowledge and qualitative reasoning is the Cognitive Map. The background of Cognitive Maps is the research about learning environments c...
151
click to vote
RELMICS
2005
Springer
16 years 3 days ago
2005
Springer
In this paper we present some examples of relational correspondences for not necessarily distributive lattices with modal-like operators of possibility (normal and additive operato...