Sciweavers

1208 search results - page 144 / 242
» Uniform eventown problems
Sort
View
WALCOM
2007
IEEE
82views Algorithms» more  WALCOM 2007»
14 years 11 months ago
Methods for Searching Mutual Visible-Intervals on Moving Object
Abstract. Computing visible information, such as a visible surface determination, is a significant problem and has been mainly studied in the fields of computational geometry and...
Yoshiyuki Kusakari, Yuta Sugimoto, Junichi Notoya,...
CEC
2010
IEEE
14 years 11 months ago
A Mean-Variance Optimization algorithm
A new stochastic optimization algorithm referred to by the authors as the `Mean-Variance Optimization' (MVO) algorithm is presented in this paper. MVO falls into the category ...
Istvan Erlich, Ganesh K. Venayagamoorthy, Nakawiro...
GECCO
2008
Springer
108views Optimization» more  GECCO 2008»
14 years 11 months ago
The effects of mutation and directed intervention crossover when applied to scheduling chemotherapy
This paper discusses the effects of mutation and directed intervention crossover approaches when applied to the derivation of cancer chemotherapy treatment schedules. Unlike trad...
Paul M. Godley, David E. Cairns, Julie Cowie, Kevi...
CORR
2010
Springer
103views Education» more  CORR 2010»
14 years 10 months ago
On the Finite Time Convergence of Cyclic Coordinate Descent Methods
Cyclic coordinate descent is a classic optimization method that has witnessed a resurgence of interest in machine learning. Reasons for this include its simplicity, speed and stab...
Ankan Saha, Ambuj Tewari
ECCC
2010
95views more  ECCC 2010»
14 years 10 months ago
Bounded-depth circuits cannot sample good codes
We study a variant of the classical circuit-lower-bound problems: proving lower bounds for sampling distributions given random bits. We prove a lower bound of 1 - 1/n(1) on the st...
Shachar Lovett, Emanuele Viola