Sciweavers

425 search results - page 37 / 85
» Homothetic interval orders
Sort
View
JCT
2010
94views more  JCT 2010»
14 years 10 months ago
Growth diagrams for the Schubert multiplication
We present a partial generalization to Schubert calculus on flag varieties of the classical Littlewood-Richardson rule, in its version based on Sch¨utzenberger’s jeu de taquin....
Cristian Lenart
RECOMB
2010
Springer
14 years 10 months ago
Consistency of Sequence-Based Gene Clusters
In comparative genomics, various combinatorial models can be used to specify gene clusters — groups of genes that are co-located in a set of genomes. Several approaches have been...
Roland Wittler, Jens Stoye
ALGORITHMICA
2008
111views more  ALGORITHMICA 2008»
14 years 12 months ago
Fixed-Parameter Complexity of Minimum Profile Problems
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...
Gregory Gutin, Stefan Szeider, Anders Yeo
AMC
2005
138views more  AMC 2005»
14 years 11 months ago
Optimal centers in branch-and-prune algorithms for univariate global optimization
We present an interval branch-and-prune algorithm for computing verified enclosures for the global minimum and all global minimizers of univariate functions subject to bound const...
D. G. Sotiropoulos, T. N. Grapsa
ICTAI
2005
IEEE
15 years 5 months ago
Reachability Analysis for Uncertain SSPs
Stochastic Shortest Path problems (SSPs) can be efficiently dealt with by the Real-Time Dynamic Programming algorithm (RTDP). Yet, RTDP requires that a goal state is always reach...
Olivier Buffet