158 search results - page 25 / 32 » On Complexity of Optimal Recombination for Binary Representa... |
ICCCN
2007
IEEE
14 years 1 months ago
2007
IEEE
—Motivated by the fact that most of the existing QoS service composition solutions have limited scalability, we develop a hierarchical-based solution framework to achieve scalabi...
CVPR
2006
IEEE
13 years 11 months ago
2006
IEEE
A wide range of computer vision applications such as distance field computation, shape from shading, and shape representation require an accurate solution of a particular Hamilton...
AAAI
2000
13 years 9 months ago
2000
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
GECCO
2003
Springer
14 years 25 days ago
2003
Springer
A bit climber using a Gray encoding is guaranteed to converge to a global optimum in fewer than ¢¤£¦¥¨§© evaluations on unimodal 1-D functions and on multi-dimensional sph...
TON
2012
11 years 10 months ago
2012
—The benefits of using mobile base station to prolong sensor network lifetime have been well recognized. However, due to the complexity of the problem (time-dependent network to...