10988 search results - page 2045 / 2198 » Algorithmic Folding Complexity |
119
Voted
AAAI
2004
15 years 4 months ago
2004
Combinatorial auctions (CAs) are important mechanisms for allocating interrelated items. Unfortunately, winner determination is NP-complete unless there is special structure. We s...
159
click to vote
ACST
2006
15 years 4 months ago
2006
Pattern discovery in DNA sequences is one of the most challenging tasks in molecular biology and computer science. The main goal of pattern discovery in DNA sequences is to identi...
126
click to vote
CAINE
2006
15 years 4 months ago
2006
The synergy of software and hardware leads to efficient application expression profile (AEP) not only in terms of execution time and energy but also optimal architecture usage. We...
145
Voted
DLOG
2006
15 years 4 months ago
2006
Abstract. Modern description logic (DL) reasoners are known to be less efficient for DLs with inverse roles. The current loss of performance is largely due to the missing applicabi...
147
Voted
VMV
2004
15 years 4 months ago
2004
Unstructured tetrahedral grids are a common data representation of three-dimensional scalar fields. For convex unstructured meshes efficient rendering methods are known. For conca...