Sciweavers

2899 search results - page 66 / 580
» On the Complexity of Exclusion Algorithms for Optimization
Sort
View
GECCO
2005
Springer
160views Optimization» more  GECCO 2005»
15 years 7 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
115
Voted
ICC
2007
IEEE
141views Communications» more  ICC 2007»
15 years 7 months ago
A Decomposition-Based Low-Complexity Scheduling Scheme for Power Minimization under Delay Constraints in Time-Varying Uplink Cha
Abstract— In this paper, we investigate the problem of minimizing the average transmission power of users while guaranteeing the average delay constraints in time-varying uplink ...
Hojoong Kwon, Byeong Gi Lee
TCOM
2008
151views more  TCOM 2008»
15 years 1 months ago
Low complexity MIMO scheduling with channel decomposition using capacity upperbound
Abstract In multiuser MIMO systems, the base station schedules transmissions to a group of users simultaneously. Since the data transmitted to each user are different, in order to ...
Xiaojie Zhang, Jungwoo Lee
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
15 years 2 months ago
Expected-case complexity of approximate nearest neighbor searching
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
Sunil Arya, Ho-Yam Addy Fu
IJCGA
2010
155views more  IJCGA 2010»
14 years 12 months ago
Competitive Complexity of Mobile Robot on-Line Motion Planning Problems
This paper is concerned with on-line problems where a mobile robot of size D has to achieve a task in an unknown planar environment whose geometry is acquired by the robot during ...
Yoav Gabriely, Elon Rimon