Sciweavers

3433 search results - page 73 / 687
» Heuristics for a bidding problem
Sort
View
CORR
2011
Springer
180views Education» more  CORR 2011»
13 years 22 days ago
Lower Bound for Envy-Free and Truthful Makespan Approximation on Related Machines
We study problems of scheduling jobs on related machines so as to minimize the makespan in the setting where machines are strategic agents. In this problem, each job j has a lengt...
Lisa Fleischer, Zhenghui Wang
GROUP
2009
ACM
14 years 3 months ago
Usability heuristics for networked multiplayer games
Networked multiplayer games must support a much wider variety of interactions than single-player games because networked games involve communication and coordination between playe...
David Pinelle, Nelson Wong, Tadeusz Stach, Carl Gu...
FLAIRS
2007
13 years 11 months ago
Search Ordering Heuristics for Restarts-Based Constraint Solving
Constraint Satisfaction Problems are ubiquitous in Artificial Intelligence. Over the past decade significant advances have been made in terms of the size of problem instance tha...
Margarita Razgon, Barry O'Sullivan, Gregory M. Pro...
GECCO
2007
Springer
178views Optimization» more  GECCO 2007»
14 years 3 months ago
Analyzing heuristic performance with response surface models: prediction, optimization and robustness
This research uses a Design of Experiments (DOE) approach to build a predictive model of the performance of a combinatorial optimization heuristic over a range of heuristic tuning...
Enda Ridge, Daniel Kudenko
ICAI
2004
13 years 10 months ago
An Efficient Heuristic Bundle Search Algorithm for Buyers in Electronic Markets
In the age of electronic commerce, with low-cost information access, it has been recognized that a bundle search in a combinatorial trade is very valuable for buyers. Optimal trav...
Linli He, Thomas R. Ioerger