14548 search results - page 319 / 2910 » The Optimal Path-Matching Problem |
158
click to vote
IPPS
2000
IEEE
15 years 11 months ago
2000
IEEE
This paper presents a novel broadband multimedia service called TV-Anytime. The basic idea of this service is to store broadcast media assets onto media server systems and allow c...
183
click to vote
GECCO
1999
Springer
15 years 11 months ago
1999
Springer
In this paper, we discuss the adaptability of Coevolutionary Genetic Algorithms on dynamic environments. Our CGA consists of two populations: solution-level one and schema-level o...
173
click to vote
CSCLP
2004
Springer
15 years 10 months ago
2004
Springer
Covering arrays have been studied for their applications to drug screening and software and hardware testing. In this paper, we model the problem as a constraint program. Our propo...
174
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
We provide a framework to exploit dependencies among arms in multi-armed bandit problems, when the dependencies are in the form of a generative model on clusters of arms. We find ...
179
click to vote
EVOW
2007
Springer
16 years 25 days ago
2007
Springer
We present a Lagrangian decomposition approach for the Knapsack Constrained Maximum Spanning Tree problem yielding upper bounds as well as heuristic solutions. This method is furth...