2520 search results - page 309 / 504 » The complexity of approximating entropy |
136
click to vote
ISICA
2007
Springer
16 years 21 days ago
2007
Springer
Abstract. MOEA/D is a novel and successful Multi-Objective Evolutionary Algorithms(MOEA) which utilizes the idea of problem decomposition to tackle the complexity from multiple obj...
170
click to vote
ISNN
2007
Springer
16 years 21 days ago
2007
Springer
Normal fuzzy CMAC neural network performs well because of its fast learning speed and local generalization capability for approximating nonlinear functions. However, it requires hu...
177
click to vote
ISSAC
2007
Springer
16 years 21 days ago
2007
Springer
We describe some major recent progress in exact and symbolic linear algebra. These advances concern the improvement of complexity estimates for fundamental problems such as linear...
195
click to vote
PATMOS
2007
Springer
16 years 20 days ago
2007
Springer
This work deals with the problem to optimise the energy consumption of an embedded system. On system level, tasks are assumed to have a certain CPU-usage they need for completion. ...
176
click to vote
SOFSEM
2007
Springer
16 years 20 days ago
2007
Springer
The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A ...