8647 search results - page 164 / 1730 » The Container Selection Problem |
118
click to vote
IAT
2010
IEEE
15 years 1 months ago
2010
IEEE
The allocation of m resources between n agents is an AI problem with a great practical interest for automated trading. The general question is how to configure the behavior of barg...
128
click to vote
CONEXT
2006
ACM
15 years 9 months ago
2006
ACM
Confronted with the generalization of monitoring in operational networks, researchers have proposed placement algorithms that can help ISPs deploy their monitoring infrastructure ...
118
click to vote
CSR
2006
Springer
15 years 7 months ago
2006
Springer
Given two strings (a text t of length n and a pattern p) and a natural number w, window subsequence problems consist in deciding whether p occurs as a subsequence of t and/or findi...
138
click to vote
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable nei...
119
click to vote
ATMOS
2007
15 years 4 months ago
2007
In this paper we study a general formulation of the train platforming problem, which contains as special cases all the versions previously considered in the literature as well as a...