Sciweavers

2126 search results - page 64 / 426
» An optimization algorithm for imprecise multi-objective prob...
Sort
View
COLT
2006
Springer
15 years 8 months ago
Logarithmic Regret Algorithms for Online Convex Optimization
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...
Elad Hazan, Adam Kalai, Satyen Kale, Amit Agarwal
APWEB
2010
Springer
15 years 7 months ago
An Incremental Prefix Filtering Approach for the All Pairs Similarity Search Problem
Given a set of records, a threshold value t and a similarity function, we investigate the problem of finding all pairs of records such that similarity between each pair is above t....
Hoang Thanh Lam, Dinh Viet Dung, Raffaele Perego, ...
JMLR
2010
129views more  JMLR 2010»
14 years 11 months ago
Learning Polyhedral Classifiers Using Logistic Function
In this paper we propose a new algorithm for learning polyhedral classifiers. In contrast to existing methods for learning polyhedral classifier which solve a constrained optimiza...
Naresh Manwani, P. S. Sastry
CDC
2010
IEEE
182views Control Systems» more  CDC 2010»
14 years 11 months ago
An approximate dual subgradient algorithm for multi-agent non-convex optimization
We consider a multi-agent optimization problem where agents aim to cooperatively minimize a sum of local objective functions subject to a global inequality constraint and a global ...
Minghui Zhu, Sonia Martínez
CP
2009
Springer
16 years 5 months ago
Coalition Structure Generation Utilizing Compact Characteristic Function Representations
This paper presents a new way of formalizing the Coalition Structure Generation problem (CSG), so that we can apply constraint optimization techniques to it. Forming effective coal...
Naoki Ohta, Vincent Conitzer, Ryo Ichimura, Yuko S...