322 search results - page 61 / 65 » Combinations of Abstract Domains for Logic Programming |
HICSS
2005
IEEE
15 years 5 months ago
2005
IEEE
Abstract. We seek to distinguish Strategic design decisions (e.g., to adopt a programming paradigm, architectural style, CBSE standard or application framework) from tactical desig...
78
Voted
CP
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. Empirical hardness models are a recent approach for studying NP-hard problems. They predict the runtime of an instance using efficiently computable features. Previous res...
CP
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...
CIKM
2008
Springer
15 years 1 months ago
2008
Springer
MetaMap is an online application that allows mapping text to UMLS Metathesaurus concepts, which is very useful interoperability among different languages and systems within the bi...
181
click to vote
ICDE
2008
IEEE
16 years 29 days ago
2008
IEEE
Abstract-- A decomposition of a binary matrix into two matrices gives a set of basis vectors and their appropriate combination to form the original matrix. Such decomposition solut...