Sciweavers

1921 search results - page 156 / 385
» The Student-Project Allocation Problem
Sort
View
IAT
2009
IEEE
15 years 4 months ago
A Multi-agent Resource Negotiation for Social Welfare
This study seeks to provide scalable and distributed algorithms to solve the resource allocation problem within an agent community. We propose an approach that can be applied to a...
Antoine Nongaillard, Philippe Mathieu
JAIR
2007
141views more  JAIR 2007»
15 years 6 months ago
Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
Alex S. Fukunaga, Richard E. Korf
ICSM
2009
IEEE
15 years 4 months ago
Visualizing the structure of field testing problems
Field testing of a software application prior to general release is an important and essential quality assurance step. Field testing helps identify unforeseen problems. Extensive ...
Brian Chan, Ying Zou, Ahmed E. Hassan, Anand Sinha
CP
2006
Springer
15 years 10 months ago
A Simple Distribution-Free Approach to the Max k-Armed Bandit Problem
The max k-armed bandit problem is a recently-introduced online optimization problem with practical applications to heuristic search. Given a set of k slot machines, each yielding p...
Matthew J. Streeter, Stephen F. Smith
JCO
2008
102views more  JCO 2008»
15 years 6 months ago
Stable matching problems with exchange restrictions
We study variants of classical stable matching problems in which there is an additional requirement for a stable matching, namely that there should not be two participants who wou...
Robert W. Irving