648 search results - page 48 / 130 » Using Criticalities as a Heuristic for Answer Set Programmin... |
KDD
2006
ACM
16 years 1 months ago
2006
ACM
Privacy becomes a more and more serious concern in applications involving microdata. Recently, efficient anonymization has attracted much research work. Most of the previous metho...
118
click to vote
ICLP
2003
Springer
15 years 6 months ago
2003
Springer
We equip ordered logic programs with negation as failure, using a simple generalization of the preferred answer set semantics for ordered programs. This extension supports a conven...
112
click to vote
WABI
2009
Springer
15 years 8 months ago
2009
Springer
Background: Supertree methods combine the phylogenetic information from multiple partially-overlapping trees into a larger phylogenetic tree called a supertree. Several supertree ...
119
click to vote
IPCO
2007
15 years 2 months ago
2007
Abstract. A well established heuristic approach for solving various bicriteria optimization problems is to enumerate the set of Pareto optimal solutions, typically using some kind ...
108
click to vote
TCBB
2008
15 years 1 months ago
2008
Reconstruction of phylogenetic trees is a fundamental problem in computational biology. While excellent heuristic methods are available for many variants of this problem, new adva...