900 search results - page 59 / 180 » On Polynomial Time Computation over Unordered Structures |
POPL
2003
ACM
14 years 9 months ago
2003
ACM
Given a program and two variables p and q, the goal of points-to analysis is to check if p can point to q in some execution of the program. This well-studied problem plays a cruci...
SBBD
2004
13 years 10 months ago
2004
Multi-valued dependencies (MVDs) are an important class of constraints that is fundamental for relational database design. Although modern applications increasingly require the su...
AI
2007
Springer
13 years 9 months ago
2007
Springer
One difficulty that arises in abstract argument systems is that many natural questions regarding argument acceptability are, in general, computationally intractable having been c...
ANOR
2002
13 years 8 months ago
2002
We introduce a distribution center (DC) location model that incorporates working inventory and safety stock inventory costs at the distribution centers. In addition, the model inco...
RECOMB
2009
Springer
14 years 9 months ago
2009
Springer
Abstract. Accurate comparative analysis tools for low-homology proteins remains a difficult challenge in computational biology, especially sequence alignment and consensus folding ...