Sciweavers

4131 search results - page 74 / 827
» The Generalized Max-Controlled Set Problem
Sort
View
MOR
2008
169views more  MOR 2008»
15 years 3 months ago
The Flow Set with Partial Order
The flow set with partial order is a mixed-integer set described by a budget on total flow and a partial order on the arcs that may carry positive flow. This set is a common substr...
Alper Atamtürk, Muhong Zhang
EVOW
2005
Springer
15 years 8 months ago
Property Analysis of Symmetric Travelling Salesman Problem Instances Acquired Through Evolution
We show how an evolutionary algorithm can successfully be used to evolve a set of difficult to solve symmetric travelling salesman problem instances for two variants of the Lin-Ker...
Jano I. van Hemert
CORR
2004
Springer
103views Education» more  CORR 2004»
15 years 2 months ago
Online convex optimization in the bandit setting: gradient descent without a gradient
We study a general online convex optimization problem. We have a convex set S and an unknown sequence of cost functions c1, c2, . . . , and in each period, we choose a feasible po...
Abraham Flaxman, Adam Tauman Kalai, H. Brendan McM...
COCO
2003
Springer
162views Algorithms» more  COCO 2003»
15 years 8 months ago
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
Amit Chakrabarti, Subhash Khot, Xiaodong Sun
AUTOMATICA
2007
70views more  AUTOMATICA 2007»
15 years 3 months ago
Squaring the circle: An algorithm for generating polyhedral invariant sets from ellipsoidal ones
This paper presents a new (geometrical) approach to the computation of polyhedral (robustly) positively invariant (PI) sets for general (possibly discontinuous) nonlinear discrete...
A. Alessio, Mircea Lazar, Alberto Bemporad, W. P. ...