5214 search results - page 148 / 1043 » The Online Specialization Problem |
133
Voted
ESA
2006
Springer
15 years 7 months ago
2006
Springer
An instance of the generalized partial cover problem consists of a ground set U and a family of subsets S 2U . Each element e U is associated with a profit p(e), whereas each su...
139
click to vote
ORL
2008
15 years 4 months ago
2008
We define a generalized variant of the satisfiability problem (SAT) where each "clause" is an or-list of inequalities in n variables. The inequality satisfiability probl...
129
Voted
CCE
2004
15 years 3 months ago
2004
This contribution deals with scheduling problems of flexible chemical batch processes with a special emphasis on their real-time character. This implies not only the need for suff...
134
click to vote
CORR
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfec...
150
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...