Sciweavers

1523 search results - page 2 / 305
» Partially ordered secretaries
Sort
View
ICALP
2009
Springer
14 years 5 months ago
Algorithms for Secretary Problems on Graphs and Hypergraphs
We examine several online matching problems, with applications to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G, with partite sets L, R. We...
Martin Pál, Nitish Korula
PVLDB
2010
135views more  PVLDB 2010»
13 years 2 days ago
Efficient Skyline Evaluation over Partially Ordered Domains
Although there has been a considerable body of work on skyline evaluation in multidimensional data with totally ordered attribute domains, there are only a few methods that consid...
Shiming Zhang, Nikos Mamoulis, Ben Kao, David Wai-...
JSYML
2010
129views more  JSYML 2010»
13 years 3 days ago
On changing cofinality of partially ordered sets
It is shown that under GCH every poset preserves its cofinality in any cofinality preserving extension. On the other hand, starting with measurable cardinals, a model with a part...
Moti Gitik
STTT
2010
120views more  STTT 2010»
13 years 1 days ago
Solving the ignoring problem for partial order reduction
Abstract. Partial order reduction limits the state explosion problem that arises in model checking by limiting the exploration of redundant interleavings. A state space search algo...
Sami Evangelista, Christophe Pajault
DM
2011
238views Education» more  DM 2011»
13 years 9 days ago
A combinatorial approach to height sequences in finite partially ordered sets
Fix an element x of a finite partially ordered set P on n elements. Then let hi(x) be the number of linear extensions of P in which x is in position i, counting from the bottom. T...
Csaba Biró, William T. Trotter