9719 search results - page 165 / 1944 » Answer Set Optimization |
200
click to vote
ANTSW
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. In this paper we present a study of several Ant Colony Optimization (ACO) algorithms for the Set Covering Problem. In our computational study we emphasize the influence ...
162
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
A fixed-point free involution on a finite set S is defined as a bijection I : S S such as e S, I(I(e)) = e and e S, I(e) = e. In this article, the fixed-point free involutions ...
186
click to vote
EDBT
2004
ACM
16 years 6 months ago
2004
ACM
We study the problem of answering queries over sources with limited access patterns. The problem is to decide whether a given query Q is feasible, i.e., equivalent to an executable...
197
click to vote
SIGMETRICS
2010
ACM
15 years 4 months ago
2010
ACM
Many network-management problems in large backbone networks need the answer to a seemingly simple question: where does a given IP packet, entering the network at a particular plac...
209
click to vote
DLOG
2011
14 years 10 months ago
2011
Query answering in Ontology Based Data Access (OBDA) exploits the knowledge of an ontology’s TBox to deal with incompleteness of the ABox (or data source). Current query-answerin...