Sciweavers

6562 search results - page 147 / 1313
» Noetherianity and Combination Problems
Sort
View
SODA
2010
ACM
155views Algorithms» more  SODA 2010»
16 years 3 months ago
A Space--Time Tradeoff for Permutation Problems
Many combinatorial problems--such as the traveling salesman, feedback arcset, cutwidth, and treewidth problem-can be formulated as finding a feasible permutation of n elements. Ty...
Mikko Koivisto, Pekka Parviainen
140
Voted
EVOW
2007
Springer
16 years 8 days ago
Genetic Algorithms with Elitism-Based Immigrants for Changing Optimization Problems
Abstract. Addressing dynamic optimization problems has been a challenging task for the genetic algorithm community. Over the years, several approaches have been developed into gene...
Shengxiang Yang
ISCC
2006
IEEE
154views Communications» more  ISCC 2006»
16 years 4 days ago
Decentralized Load Balancing for Highly Irregular Search Problems
In this paper, we present a Dynamic Load Balancing (DLB) policy for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available....
Giuseppe Di Fatta, Michael R. Berthold
KES
2005
Springer
15 years 11 months ago
A Robust Approach for Improving Computational Efficiency of Order-Picking Problems
The new market forces have affected the operation of distribution centers (DCs) extremely. The DCs demand an increased productivity and a low cost in their daily operation. This pa...
Yu-Min Chiang, Shih-Hsin Chen, Kuo-Chang Wu
160
Voted
HICSS
2002
IEEE
88views Biometrics» more  HICSS 2002»
15 years 11 months ago
An Empirical Study of the Use Contexts and Usability Problems in Mobile Internet
Mobile Internet, which is a combination of the Internet with mobile devices, has become popular recently. Mobile Internet is primarily different from stationary Internet in that i...
Hoyoung Kim, Jinwoo Kim, Yeonsoo Lee, Minhee Chae,...