Sciweavers

4983 search results - page 31 / 997
» order 2008
Sort
View
EOR
2008
91views more  EOR 2008»
14 years 12 months ago
A branch-and-bound algorithm for the linear ordering problem with cumulative costs
The Linear Ordering Problem with Cumulative Costs is an NP-hard combinatorial optimization problem arising from an application in UMTS mobile-phone communication systems. This pap...
Giovanni Righini
JOLLI
2008
67views more  JOLLI 2008»
14 years 11 months ago
Optionality, Scope, and Licensing: An Application of Partially Ordered Categories
Abstract. This paper uses a partially ordered set of syntactic categories to accommodate optionality and licensing in natural language syntax. A complex but well-studied data set p...
Raffaella Bernardi, Anna Szabolcsi
DM
2007
123views more  DM 2007»
14 years 11 months ago
Totally anti-symmetric quasigroups for all orders n =/ 2, 6
A quasigroup (Q, ∗) is called totally anti-symmetric if (c ∗ x) ∗ y = (c ∗ y) ∗ x ⇒ x = y and x∗y = y∗x ⇒ x = y. A totally anti-symmetric quasigroup can be used ...
H. Michael Damm
MP
2008
137views more  MP 2008»
14 years 11 months ago
Valid inequalities and restrictions for stochastic programming problems with first order stochastic dominance constraints
Stochastic dominance relations are well-studied in statistics, decision theory and economics. Recently, there has been significant interest in introducing dominance relations into...
Nilay Noyan, Andrzej Ruszczynski
BSL
2005
106views more  BSL 2005»
14 years 11 months ago
Compactness and independence in non first order frameworks
This communication deals with positive model theory, a non first order model theoretic setting which preserves compactness at the cost of giving up negation. Positive model theory ...
Itay Ben-Yaacov