1092 search results - page 180 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
101
click to vote
GECCO
2009
Springer
15 years 8 months ago
2009
Springer
Many successful applications have proven the potential of Learning Classifier Systems and the XCS classifier system in particular in datamining, reinforcement learning, and func...
94
Voted
GLOBECOM
2008
IEEE
15 years 8 months ago
2008
IEEE
Abstract—In modern DSL networks, crosstalk among different lines (i.e., users) is the major source of performance degradation. Dynamic Spectrum Management (DSM) refers to a set o...
111
Voted
INFOCOM
2008
IEEE
15 years 8 months ago
2008
IEEE
— The relay node placement problem for wireless sensor networks is concerned with placing a minimum number of relay nodes into a wireless sensor network to meet certain connectiv...
129
Voted
RTSS
2007
IEEE
15 years 8 months ago
2007
IEEE
Many distributed real-time systems face the challenge of dynamically maximizing system utility and meeting stringent resource constraints in response to fluctuations in system wo...
115
Voted
COCO
2007
Springer
15 years 8 months ago
2007
Springer
The NP machine hypothesis posits the existence of an ǫ > 0 and a nondeterministic polynomial-time Turing machine M which accepts the language 0∗ but for which no determinist...