Sciweavers

225 search results - page 5 / 45
» Approximating Parameterized Convex Optimization Problems
Sort
View
GECCO
2008
Springer
168views Optimization» more  GECCO 2008»
13 years 10 months ago
Parameterizing pair approximations for takeover dynamics
Pair approximations have often been used to predict equilibrium conditions in spatially-explicit epidemiological and ecological systems. In this work, we investigate whether this ...
Joshua L. Payne, Margaret J. Eppstein
JGO
2010
117views more  JGO 2010»
13 years 8 months ago
Machine learning problems from optimization perspective
Both optimization and learning play important roles in a system for intelligent tasks. On one hand, we introduce three types of optimization tasks studied in the machine learning l...
Lei Xu
JCAM
2011
69views more  JCAM 2011»
13 years 18 days ago
Comonotonic approximations for a generalized provisioning problem with application to optimal portfolio selection
In this paper we discuss multiperiod portfolio selection problems related to a speci…c provisioning problem. Our results are an extension of Dhaene et al. (2005), where optimal ...
Koen Van Weert, Jan Dhaene, Marc J. Goovaerts
MST
2007
167views more  MST 2007»
13 years 9 months ago
The Complexity of Polynomial-Time Approximation
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
Liming Cai, Michael R. Fellows, David W. Juedes, F...
SPAA
2009
ACM
14 years 10 months ago
Brief announcement: parameterized maximum and average degree approximation in topic-based publish-subscribe overlay network desi
Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For scala...
Melih Onus, Andréa W. Richa