8437 search results - page 684 / 1688 » Preferences over Sets |
191
click to vote
SODA
2003
ACM
15 years 8 months ago
2003
ACM
We prove a lower bound of 0.3288 n 4¡ for the rectilinear crossing number cr(Kn) of a complete graph on n vertices, or in other words, for the minimum number of convex quadril...
189
click to vote
WSC
1998
15 years 8 months ago
1998
We define the term "digital object" and specify a variety of qualities that are important during the object design phase. A digital object contains a set of models, and ...
240
click to vote
APPROX
2010
Springer
15 years 7 months ago
2010
Springer
We study the problem of monotonicity testing over the hypercube. As previously observed in several works, a positive answer to a natural question about routing properties of the hy...
189
click to vote
AUTOMATICA
2010
15 years 7 months ago
2010
We propose a class of discrete-time dynamic average consensus algorithms that allow a group of agents to track the average of their reference inputs. The convergence results rely ...
172
click to vote
AUTOMATICA
2008
15 years 7 months ago
2008
This paper proposes a disturbance-based control parametrization under the Model Predictive Control framework for constrained linear discrete time systems with bounded additive dis...