Sciweavers

4451 search results - page 71 / 891
» On Random Ordering Constraints
Sort
View
JCO
2008
84views more  JCO 2008»
14 years 11 months ago
Partitioning a weighted partial order
The problem of partitioning a partially ordered set into a minimum number of chains is a well-known problem. In this paper we study a generalization of this problem, where we not ...
Linda S. Moonen, Frits C. R. Spieksma
COMBINATORICS
2006
92views more  COMBINATORICS 2006»
14 years 12 months ago
Equitable Matroids
One way to choose a basis of a matroid at random is to choose an ordering of the ground set uniformly at random and then use the greedy algorithm to find a basis. We investigate t...
Dillon Mayhew
ICASSP
2011
IEEE
14 years 3 months ago
MRF-based automatic image ordering and its application to mosaicing
A fast and robust auto-sorting method for image ordering based on Markov Random Fields (MRF) is proposed. We present a specific MRF model for the ordering problem and use pairwis...
Ran Song, Yonghuai Liu, Yitian Zhao, Ralph R. Mart...
CP
2009
Springer
16 years 14 days ago
On Decomposing Knapsack Constraints for Length-Lex Bounds Consistency
The length-lex representation for set variables orders all subsets of a given universe of values according to cardinality and lexicography. To achieve length-lex bounds consistency...
Meinolf Sellmann
CADE
2001
Springer
16 years 4 days ago
A Sequent Calculus for First-Order Dynamic Logic with Trace Modalities
The modalities of Dynamic Logic refer to the final state of a program execution and allow to specify programs with pre- and postconditions. In this paper, we extend Dynamic Logic w...
Bernhard Beckert, Steffen Schlager