221 search results - page 15 / 45 » Analyzing the Implicit Computational Complexity of object-or... |
SUM
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. In this paper we introduce a fixpoint semantics for quantitative logic programming, which is able to both combine and correlate evidence from different sources of infor...
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
In this paper, we analyze two general-purpose encoding types, trees and graphs systematically, focusing on trends over increasingly complex problems. Tree and graph encodings are ...
178
click to vote
ICLP
2009
Springer
15 years 10 months ago
2009
Springer
We study finding similar or diverse solutions of a given computational problem, in answer set programming, and introduce offline methods and online methods to compute them using an...
130
click to vote
CPE
1994
Springer
15 years 1 months ago
1994
Springer
When implementingparallel programs forparallel computer systems the performancescalability of these programs should be tested and analyzed on different computer configurations and...
NSDI
2008
14 years 12 months ago
2008
This paper presents Swift, a packet filter for high performance packet capture on commercial off-the-shelf hardware. The key features of Swift include (1) extremely low filter upd...