920 search results - page 118 / 184 » Generating Satisfiable Problem Instances |
135
click to vote
EMNLP
2011
14 years 13 days ago
2011
This paper describes a novel approach to the semantic relation detection problem. Instead of relying only on the training instances for a new relation, we leverage the knowledge l...
110
Voted
ICCAD
2009
IEEE
14 years 10 months ago
2009
IEEE
Boolean satisfiability (SAT) based methods have traditionally been popular for formally verifying properties for digital circuits. We present a novel methodology for formulating a...
117
Voted
TON
2010
14 years 7 months ago
2010
Abstract--In communication networks, multiple disjoint communication paths are desirable for many applications. Such paths, however, may not exist in a network. In such a situation...
147
click to vote
SIAMREV
2010
14 years 7 months ago
2010
The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the ...
116
click to vote
FLAIRS
2008
15 years 3 months ago
2008
Preferences in constraint problems are common but significant in many real world applications. In this paper, we extend our conditional and composite CSP (CCCSP) framework, managi...