2606 search results - page 86 / 522 » cost 2008 |
DAM
1998
14 years 11 months ago
1998
We study a discrete problem of scheduling activities of several types under the constraint that at most a single activity can be scheduled to any one period. Applications of such ...
110
click to vote
DKE
1999
14 years 11 months ago
1999
A Data Warehouse DW is a database that collects and stores data from multiple remote and heterogeneous information sources. When a query is posed, it is evaluated locally, without...
CSDA
2006
14 years 12 months ago
2006
The cost-complexity pruning generates nested subtrees and selects the best one. However, its computational cost is large since it uses holdout sample or cross-validation. On the o...
120
click to vote
TPDS
2002
14 years 11 months ago
2002
One of the most fundamental problems automatic parallelization tools are confronted with is to find an optimal domain decomposition for a given application. For regular domain prob...
109
click to vote
CSCLP
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. Many agent coordination problems can be modeled as distributed constraint optimization problems (DCOPs). ADOPT is an asynchronous and distributed search algorithm that is...