Sciweavers

9842 search results - page 255 / 1969
» Problem complexity
Sort
View
GECCO
2009
Springer
199views Optimization» more  GECCO 2009»
15 years 11 months ago
Using behavioral exploration objectives to solve deceptive problems in neuro-evolution
Encouraging exploration, typically by preserving the diversity within the population, is one of the most common method to improve the behavior of evolutionary algorithms with dece...
Jean-Baptiste Mouret, Stéphane Doncieux
PVLDB
2010
168views more  PVLDB 2010»
15 years 5 months ago
Active Complex Event Processing: Applications in Real-Time Health Care
Our analysis of many real-world event based applications has revealed that existing Complex Event Processing technology (CEP), while effective for efficient pattern matching on e...
Di Wang, Elke A. Rundensteiner, Richard Ellison, H...
ICC
2009
IEEE
190views Communications» more  ICC 2009»
16 years 1 months ago
Decomposition for Low-Complexity Near-Optimal Routing in Multi-Hop Wireless Networks
Abstract—Network flow models serve as a popular mathematical framework for the analysis and optimization of Multi-hop Wireless Networks. They also serve to provide the understan...
Vinay Kolar, Nael B. Abu-Ghazaleh, Petri Mäh&...
LATA
2010
Springer
16 years 1 months ago
Choosing Word Occurrences for the Smallest Grammar Problem
The smallest grammar problem - namely, finding a smallest context-free grammar that generates exactly one sequence - is of practical and theoretical importance in fields such as ...
Rafael Carrascosa, François Coste, Matthias...
CSL
2009
Springer
16 years 1 months ago
Decision Problems for Nash Equilibria in Stochastic Games
We analyse the computational complexity of finding Nash equilibria in stochastic multiplayer games with ω-regular objectives.While the existence of an equilibrium whose payoff fal...
Michael Ummels, Dominik Wojtczak