Sciweavers

550 search results - page 1 / 110
» A simple and effective algorithm for the MaxMin diversity pr...
Sort
View
ANOR
2011
117views more  ANOR 2011»
12 years 8 months ago
A simple and effective algorithm for the MaxMin diversity problem
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...
Daniel Cosmin Porumbel, Jin-Kao Hao, Fred Glover
ESANN
2006
13 years 6 months ago
OnlineDoubleMaxMinOver: a simple approximate time and information efficient online Support Vector Classification method
Abstract. We present the OnlineDoubleMaxMinOver approach to obtain the Support Vectors in two class classification problems. With its linear time complexity and linear convergence ...
Daniel Schneegaß, Thomas Martinetz, Michael ...
STOC
2009
ACM
96views Algorithms» more  STOC 2009»
14 years 5 months ago
MaxMin allocation via degree lower-bounded arborescences
We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j...
MohammadHossein Bateni, Moses Charikar, Venkatesan...
DAGM
2008
Springer
13 years 6 months ago
Simple Incremental One-Class Support Vector Classification
We introduce the OneClassMaxMinOver (OMMO) algorithm for the problem of one-class support vector classification. The algorithm is extremely simple and therefore a convenient choice...
Kai Labusch, Fabian Timm, Thomas Martinetz
INFOCOM
2006
IEEE
13 years 10 months ago
Maximum Throughput and Fair Bandwidth Allocation in Multi-Channel Wireless Mesh Networks
— Wireless mesh network is designed as an economical solution for last-mile broadband Internet access. In this paper, we study bandwidth allocation in multi-channel multihop wire...
Jian Tang, Guoliang Xue, Weiyi Zhang