1064 search results - page 106 / 213 » Exact Algorithms for the Quadratic Linear Ordering Problem |
164
click to vote
ICCAD
1997
IEEE
15 years 8 months ago
1997
IEEE
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...
139
click to vote
ALENEX
2007
15 years 5 months ago
2007
We consider the problem of designing a distributed algorithm that, given an arbitrary connected graph G of nodes with unique labels, converts G into a sorted list of nodes. This a...
129
click to vote
ICML
2006
IEEE
16 years 5 months ago
2006
IEEE
The problem of nonlinear dimensionality reduction is considered. We focus on problems where prior information is available, namely, semi-supervised dimensionality reduction. It is...
107
click to vote
CVPR
2010
IEEE
16 years 17 days ago
2010
IEEE
We consider pixel labeling problems where the label set
forms a tree, and where the observations are also labels.
Such problems arise in feature-space analysis with a very
large...
142
click to vote
CORR
2002
Springer
15 years 4 months ago
2002
Springer
: We study the satisfiability of randomly generated formulas formed by M clauses of exactly K literals over N Boolean variables. For a given value of N the problem is known to be m...