14165 search results - page 427 / 2833 » The generalized two-server problem |
181
Voted
COCOA
2008
Springer
15 years 8 months ago
2008
Springer
The goal of the Cluster Editing problem is to make the fewest changes to the edge set of an input graph such that the resulting graph is a disjoint union of cliques. This problem i...
182
click to vote
COLT
2008
Springer
15 years 8 months ago
2008
Springer
We introduce an efficient algorithm for the problem of online linear optimization in the bandit setting which achieves the optimal O ( T) regret. The setting is a natural general...
148
click to vote
IPCO
2004
15 years 8 months ago
2004
We study the convex hull of the feasible set of the semi-continuous knapsack problem, in which the variables belong to the union of two intervals. Besides being important in its o...
160
click to vote
SODA
1990
ACM
15 years 8 months ago
1990
ACM
We investigate 3-d visibility problems in which the viewing position moves along a straight flightpath. Specifically we focus on two problems: determining the points along the fli...
152
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
The standard reasoning problem, concept satisfiability, in the basic description logic ALC is PSPACE-complete, and it is EXPTIMEcomplete in the presence of unrestricted axioms. Sev...