2061 search results - page 35 / 413 » The continuous knapsack set |
125
click to vote
EOR
2010
15 years 3 months ago
2010
Continuous GRASP (C-GRASP) is a stochastic local search metaheuristic for finding cost-efficient solutions to continuous global optimization problems subject to box constraints (Hi...
138
click to vote
IUI
2011
ACM
14 years 6 months ago
2011
ACM
In this paper, we present a new type of Marking menus. Continuous Marking Menus are specifically dedicated to penbased interfaces, and designed to define a set of cursive, reali...
125
Voted
ESA
2010
Springer
15 years 5 months ago
2010
Springer
We define the robustness of a level set homology class of a function f : X R as the magnitude of a perturbation necessary to kill the class. Casting this notion into a group theor...
97
Voted
CPC
2008
15 years 3 months ago
2008
A set of integers A is called a B2[g] set if every integer m has at most g representations of the form m = a + a , with a a and a, a A. We obtain a new lower bound for F(g, n), t...
125
click to vote
EDBT
2008
ACM
16 years 4 months ago
2008
ACM
In this paper, we propose a bitmap approach for efficient subspace skyline computation in a distributed setting. Our approach computes extended skylines which have been shown to i...