1461 search results - page 172 / 293 » Complexity of Graph Covering Problems |
105
Voted
STOC
2009
ACM
16 years 2 months ago
2009
ACM
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
116
click to vote
JACM
2006
15 years 2 months ago
2006
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
103
click to vote
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
The artificial immune system approach for self-nonself discrimination and its application to anomaly detection problems in engineering is showing great promise. A seminal contribu...
103
click to vote
ATAL
2005
Springer
15 years 8 months ago
2005
Springer
We are concerned with the use of Mobile Agents for information retrieval. A multi-agent system is considered; a number of agents are involved in a collective effort to retrieve di...
104
click to vote
COMPGEOM
2008
ACM
15 years 4 months ago
2008
ACM
Generalizing the concept of a Reeb graph, the Reeb space of a multivariate continuous mapping identifies points of the domain that belong to a common component of the preimage of ...