Sciweavers

8413 search results - page 65 / 1683
» Ordering Problem Subgoals
Sort
View
ORDER
2007
89views more  ORDER 2007»
13 years 7 months ago
On-line Chain Partitioning of Up-growing Interval Orders
On-line chain partitioning problem of on-line posets has been open for the past 20 years. The best known on-line algorithm uses 5w −1 4 chains to cover poset of width w. Felsner ...
Patrick Baier, Bartlomiej Bosek, Piotr Micek
AMAI
2004
Springer
14 years 1 months ago
Combining Symmetry Breaking with Other Constraints: Lexicographic Ordering with Sums
Abstract. We introduce a new global constraint which combines together the lexicographic ordering constraint with two sum constraints. Lexicographic ordering constraints are freque...
Brahim Hnich, Zeynep Kiziltan, Toby Walsh
CP
2004
Springer
14 years 1 months ago
Computing the Frequency of Partial Orders
In this paper we study four algorithms for computing the frequency of a given partial order. Here the frequency of a partial order is the number of standard labellings respecting t...
Marc R. C. van Dongen
IDA
2010
Springer
13 years 6 months ago
Clustering with feature order preferences
We propose a clustering algorithm that effectively utilizes feature order preferences, which have the form that feature s is more important than feature t. Our clustering formulati...
Jun Sun, Wenbo Zhao, Jiangwei Xue, Zhiyong Shen, Y...
ECML
2004
Springer
13 years 11 months ago
Efficient Hyperkernel Learning Using Second-Order Cone Programming
The kernel function plays a central role in kernel methods. Most existing methods can only adapt the kernel parameters or the kernel matrix based on empirical data. Recently, Ong e...
Ivor W. Tsang, James T. Kwok