Sciweavers

3433 search results - page 76 / 687
» Heuristics for a bidding problem
Sort
View
EOR
2006
83views more  EOR 2006»
13 years 10 months ago
Lower bounds and heuristic algorithms for the k
We consider the problem of partitioning a set of positive integers values into a given number of subsets, each having an associated cardinality limit, so that the maximum sum of v...
Mauro Dell'Amico, Manuel Iori, Silvano Martello, M...
GRID
2006
Springer
13 years 10 months ago
A QoS-Aware Heuristic Algorithm for Replica Placement
This paper studies the QoS-aware replica placement problem. Although there has been much work on replica placement problem, most of them concerns average system performance and ign...
Hsiangkai Wang, Pangfeng Liu, Jan-Jan Wu
AI
2008
Springer
13 years 10 months ago
Sequential Monte Carlo in reachability heuristics for probabilistic planning
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
Daniel Bryce, Subbarao Kambhampati, David E. Smith
ESA
2007
Springer
89views Algorithms» more  ESA 2007»
14 years 4 months ago
Bundle Pricing with Comparable Items
We consider a revenue maximization problem where we are selling a set of comparable items, each available in a certain quantity (possibly unlimited) to a set of bidders. Each bidde...
Alexander Grigoriev, Joyce van Loon, Maxim Sviride...
ECAI
2004
Springer
14 years 3 months ago
Learning Techniques for Automatic Algorithm Portfolio Selection
The purpose of this paper is to show that a well known machine learning technique based on Decision Trees can be effectively used to select the best approach (in terms of efficien...
Alessio Guerri, Michela Milano