696 search results - page 67 / 140 » A class of combinatorial identities |
138
click to vote
ISMVL
2006
IEEE
16 years 9 days ago
2006
IEEE
We define the MaxSAT problem for many-valued CNF formulas, called many-valued MaxSAT, and establish its complexity class. We then describe a basic branch and bound algorithm for ...
157
click to vote
AAIM
2006
Springer
16 years 8 days ago
2006
Springer
In this note we deal with sensitivity analysis of combinatorial optimization problems and its fundamental term, the tolerance. For three classes of objective functions (Σ, Π, MA...
179
click to vote
ICAC
2005
IEEE
15 years 12 months ago
2005
IEEE
Large data centers host several application environments (AEs) that are subject to workloads whose intensity varies widely and unpredictably. Therefore, the servers of the data ce...
132
click to vote
ESA
2003
Springer
15 years 11 months ago
2003
Springer
We present a new finger search tree with O(1) worst-case update time and O(log log d) expected search time with high probability in the Random Access Machine (RAM) model of comput...
186
click to vote
STOC
2010
ACM
15 years 11 months ago
2010
ACM
There has been much progress on geometric set cover problems, but most known techniques only apply to the unweighted setting. For the weighted setting, very few results are known ...