Sciweavers

1387 search results - page 59 / 278
» Convexity in Discrete Space
Sort
View
GD
2006
Springer
14 years 1 months ago
Morphing Planar Graphs in Spherical Space
We consider the problem of intersection-free planar graph morphing, and in particular, a generalization from Euclidean space to spherical space. We show that there exists a continu...
Stephen G. Kobourov, Matthew Landis
FUIN
1998
122views more  FUIN 1998»
13 years 9 months ago
Finite Markov Chain Results in Evolutionary Computation: A Tour d'Horizon
The theory of evolutionary computation has been enhanced rapidly during the last decade. This survey is the attempt to summarize the results regarding the limit and nite time behav...
Günter Rudolph
SIAMJO
2008
84views more  SIAMJO 2008»
13 years 10 months ago
Regularity Conditions via Quasi-Relative Interior in Convex Programming
We give some new regularity conditions for Fenchel duality in separated locally convex vector spaces, written in terms of the notion of quasi interior and quasi-relative interior, ...
Radu Ioan Bot, Ernö Robert Csetnek, Gert Wank...
SMA
2008
ACM
136views Solid Modeling» more  SMA 2008»
13 years 10 months ago
Kinematic convexity of spherical displacements and its application to collision prediction
In recent years, there has been an increasing interest in developing geometric algorithms for kinematic computations. The aim of this paper is to present the notion of kinematic c...
Qiaode Jeffrey Ge, Anurag Purwar, Jun Wu
COLT
2010
Springer
13 years 8 months ago
Optimal Algorithms for Online Convex Optimization with Multi-Point Bandit Feedback
Bandit convex optimization is a special case of online convex optimization with partial information. In this setting, a player attempts to minimize a sequence of adversarially gen...
Alekh Agarwal, Ofer Dekel, Lin Xiao