15033 search results - page 314 / 3007 » Complexity Theory and Algorithms |
161
click to vote
TWC
2008
15 years 5 months ago
2008
In this paper, a dynamic subcarrier and power allocation problem is considered in the context of asymptotic utility maximization in multi-carrier systems. Using the gradient-based...
209
click to vote
EC
2007
15 years 6 months ago
2007
Randomized search heuristics (e.g., evolutionary algorithms, simulated annealing etc.) are very appealing to practitioners, they are easy to implement and usually provide good per...
165
click to vote
COCO
2005
Springer
15 years 11 months ago
2005
Springer
We introduce two new complexity measures for Boolean functions, which we name sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query com...
167
click to vote
ATAL
2009
Springer
16 years 18 days ago
2009
Springer
Multiagent systems are often characterized by complex, and sometimes unpredictable interactions amongst their autonomous components. While these systems can provide robust and sca...
153
click to vote
ADMA
2006
Springer
16 years 13 hour ago
2006
Springer
Feature selection is an important data preprocessing step in data mining and pattern recognition. Many algorithms have been proposed in the past for simple patterns that can be cha...