1529 search results - page 82 / 306 » Search Space Analysis of the Linear Ordering Problem |
151
click to vote
CP
2004
Springer
15 years 9 months ago
2004
Springer
This paper considers the problem of transforming a resource feasible, fixed-times schedule into a partial order schedule (POS) to enhance its robustness and stability properties. ...
123
click to vote
GFKL
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Existing methods to text plagiarism analysis mainly base on “chunking”, a process of grouping a text into meaningful units each of which gets encoded by an integer nu...
131
click to vote
JAIR
2007
15 years 3 months ago
2007
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
138
click to vote
MM
2005
ACM
15 years 9 months ago
2005
ACM
Latent Semantic Analysis (LSA) has shown encouraging performance for the problem of unsupervised image automatic annotation. LSA conducts annotation by keywords propagation on a l...
135
click to vote
ICASSP
2009
IEEE
15 years 10 months ago
2009
IEEE
In this paper, we propose a novel general framework for tensor based null space affine invariants, namely, tensor null space invariants (TNSI) with a linear classifier for high ...