397 search results - page 21 / 80 » Towards Polynomial Lower Bounds for Dynamic Problems |
COLT
2010
Springer
13 years 5 months ago
2010
Springer
In recent years analysis of complexity of learning Gaussian mixture models from sampled data has received significant attention in computational machine learning and theory commun...
ANOR
2005
13 years 7 months ago
2005
: We consider in this paper a two-machine flowshop scheduling problem in which the first machine processes jobs individually while the second machine processes jobs in batches. The...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
: The PDPTW is an optimization vehicles routing problem which must meet requests for transport between suppliers and customers satisfying precedence, capacity and time constraints....
AIPS
2007
13 years 10 months ago
2007
We introduce the Linear Resource Temporal Network (LRTN), which consists of activities that consume or produce a resource, subject to absolute and relative metric temporal constra...
IJMC
2006
13 years 7 months ago
2006
: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...