4940 search results - page 160 / 988 » On the Complexity of Universal Programs |
144
click to vote
BMCBI
2007
15 years 5 months ago
2007
Background: Macromolecular visualization as well as automated structural and functional annotation tools play an increasingly important role in the post-genomic era, contributing ...
151
Voted
ACMICEC
2003
ACM
15 years 10 months ago
2003
ACM
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism ...
250
Voted
ICLP
2009
Springer
16 years 5 months ago
2009
Springer
This paper considers a semantic approach for merging logic programs under answer set semantics. Given logic programs P1, . . . , Pn, the goal is to provide characterisations of the...
139
click to vote
SIGECOM
2005
ACM
15 years 10 months ago
2005
ACM
We study various computational aspects of solving games using dominance and iterated dominance. We first study both strict and weak dominance (not iterated), and show that checki...
125
Voted
APLAS
2000
ACM
15 years 9 months ago
2000
ACM
Previous studies on safety of program transformations with respect to performance considered two criteria: preserving performance within a constant factor and preserving complexit...