467 search results - page 18 / 94 » The General Yard Allocation Problem |
172
click to vote
CORR
2010
Springer
14 years 7 months ago
2010
Springer
We consider a combinatorial generalization of the classical multi-armed bandit problem that is defined as follows. There is a given bipartite graph of M users and N M resources. F...
105
Voted
GECCO
2008
Springer
15 years 1 months ago
2008
Springer
This paper presents a communication-less multi-agent task allocation procedure that allows agents to use past experience to make non-greedy decisions about task assignments. Exper...
103
click to vote
WIMOB
2008
IEEE
15 years 7 months ago
2008
IEEE
—We consider the rate allocation problem for data aggregation in wireless sensor networks with two objectives: 1) maximizing the lifetime of a local aggregation cluster and, 2) a...
87
Voted
IJCAI
2003
15 years 2 months ago
2003
In most real-world settings, due to limited time or other resources, an agent cannot perform all potentially useful deliberation and information gathering actions. This leads to t...
117
click to vote
COGSCI
2010
15 years 24 days ago
2010
With only two to five slots of visual working memory (VWM), humans are able to quickly solve complex visual problems to near optimal solutions. To explain the paradox between tigh...