1772 search results - page 246 / 355 » Classifying Problems into Complexity Classes |
120
click to vote
VLSID
1997
IEEE
15 years 4 months ago
1997
IEEE
The problem of test generation belongs to the class of NP-complete problems and it is becoming more and more di cult as the complexity of VLSI circuits increases, and as long as e...
107
click to vote
ISCI
2008
15 years 19 days ago
2008
Automatic software testing tools are still far from ideal for real world object-oriented (OO) software. The use of nature inspired search algorithms for this problem has been inve...
120
click to vote
JMMA
2002
15 years 9 days ago
2002
Convex polygons in the plane can be defined explicitly as an ordered list of vertices, or given implicitly, for example by a list of linear constraints. The latter representation h...
150
Voted
JMLR
2010
14 years 7 months ago
2010
In this paper, we propose a general framework for sparse semi-supervised learning, which concerns using a small portion of unlabeled data and a few labeled data to represent targe...
CP
2000
Springer
15 years 5 months ago
2000
Springer
Abstract. Variable elimination is the basic step of Adaptive Consistency 4 . It transforms the problem into an equivalent one, having one less variable. Unfortunately, there are ma...