Sciweavers

7773 search results - page 1403 / 1555
» On generalized Frame-Stewart numbers
Sort
View
EOR
2007
93views more  EOR 2007»
14 years 10 months ago
Exact algorithms for procurement problems under a total quantity discount structure
In this paper, we study the procurement problem faced by a buyer who needs to purchase a variety of goods from suppliers applying a so-called total quantity discount policy. This ...
Dries R. Goossens, A. J. T. Maas, Frits C. R. Spie...
KES
2006
Springer
14 years 10 months ago
Combined Gene Selection Methods for Microarray Data Analysis
In recent years, the rapid development of DNA Microarray technology has made it possible for scientists to monitor the expression level of thousands of genes in a single experiment...
Hong Hu, Jiuyong Li, Hua Wang, Grant Daggard
ML
2006
ACM
14 years 10 months ago
Universal parameter optimisation in games based on SPSA
Most game programs have a large number of parameters that are crucial for their performance. While tuning these parameters by hand is rather difficult, efficient and easy to use ge...
Levente Kocsis, Csaba Szepesvári
PAMI
2008
152views more  PAMI 2008»
14 years 10 months ago
K-Nearest Neighbor Finding Using MaxNearestDist
Abstract-Similarity searching often reduces to finding the k nearest neighbors to a query object. Finding the k nearest neighbors is achieved by applying either a depth-first or a ...
Hanan Samet
SIGECOM
2008
ACM
155views ECommerce» more  SIGECOM 2008»
14 years 10 months ago
Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
Vahab S. Mirrokni, Michael Schapira, Jan Vondr&aac...
« Prev « First page 1403 / 1555 Last » Next »