Sciweavers

8647 search results - page 155 / 1730
» The Container Selection Problem
Sort
View
CN
1999
74views more  CN 1999»
15 years 2 months ago
On the network impact of dynamic server selection
Widespread replication of information can ameliorate the problem of server overloading but raises the allied question of server selection. Clients may be assigned to a replica in ...
Robert L. Carter, Mark Crovella
CORR
2010
Springer
144views Education» more  CORR 2010»
15 years 3 months ago
Hitting forbidden minors: Approximation and Kernelization
We study a general class of problems called F -Deletion problems. In an F -Deletion problem, we are asked whether a subset of at most k vertices can be deleted from a graph G such...
Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra...
IJCNN
2000
IEEE
15 years 6 months ago
A Training Method with Small Computation for Classification
A training data selection method for multi-class data is proposed. This method can be used for multilayer neural networks (MLNN). The MLNN can be applied to pattern classification...
Kazuyuki Hara, Kenji Nakayama
GECCO
2005
Springer
160views Optimization» more  GECCO 2005»
15 years 8 months ago
On the complexity of hierarchical problem solving
Competent Genetic Algorithms can efficiently address problems in which the linkage between variables is limited to a small order k. Problems with higher order dependencies can onl...
Edwin D. de Jong, Richard A. Watson, Dirk Thierens
JAIR
2007
141views more  JAIR 2007»
15 years 3 months ago
Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
Alex S. Fukunaga, Richard E. Korf