Sciweavers

1034 search results - page 149 / 207
» Competitive generalized auctions
Sort
View
ESA
2004
Springer
96views Algorithms» more  ESA 2004»
14 years 2 months ago
An Experimental Study of Random Knapsack Problems
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimenta...
René Beier, Berthold Vöcking
ESA
2004
Springer
91views Algorithms» more  ESA 2004»
14 years 2 months ago
Maximizing Throughput in Multi-queue Switches
We study a basic problem in Multi-Queue switches. A switch connects m input ports to a single output port. Each input port is equipped with an incoming FIFO queue with bounded cap...
Yossi Azar, Arik Litichevskey
GECCO
2004
Springer
129views Optimization» more  GECCO 2004»
14 years 2 months ago
Memetic Optimization of Video Chain Designs
Abstract. Improving image quality is the backbone of highly competitive display industry. Contemporary video processing system design is a challenging optimization problem. General...
Walid Ali, Alexander P. Topchy
ICAISC
2004
Springer
14 years 2 months ago
Relevance LVQ versus SVM
Abstract. The support vector machine (SVM) constitutes one of the most successful current learning algorithms with excellent classification accuracy in large real-life problems an...
Barbara Hammer, Marc Strickert, Thomas Villmann
SIGIR
2003
ACM
14 years 2 months ago
On the effectiveness of evaluating retrieval systems in the absence of relevance judgments
Soboroff, Nicholas and Cahan recently proposed a method for evaluating the performance of retrieval systems without relevance judgments. They demonstrated that the system evaluat...
Javed A. Aslam, Robert Savell