Sciweavers

789 search results - page 30 / 158
» Solving Complex Problems Efficiently with Adaptive Automata
Sort
View
AI
2010
Springer
13 years 7 months ago
Kernel functions for case-based planning
Case-based planning can take advantage of former problem-solving experiences by storing in a plan library previously generated plans that can be reused to solve similar planning p...
Ivan Serina
SIGMOD
2009
ACM
202views Database» more  SIGMOD 2009»
14 years 7 months ago
ZStream: a cost-based query processor for adaptively detecting composite events
Composite (or Complex) event processing (CEP) systems search sequences of incoming events for occurrences of userspecified event patterns. Recently, they have gained more attentio...
Yuan Mei, Samuel Madden
GECCO
2007
Springer
138views Optimization» more  GECCO 2007»
14 years 1 months ago
Reducing the space-time complexity of the CMA-ES
A limited memory version of the covariance matrix adaptation evolution strategy (CMA-ES) is presented. This algorithm, L-CMA-ES, improves the space and time complexity of the CMA-...
James N. Knight, Monte Lunacek
DCC
2004
IEEE
14 years 7 months ago
On the Complexity of Rate-Distortion Optimal Streaming of Packetized Media
We consider the problem of rate-distortion optimal streaming of packetized media with sender-driven transmission over a single-QoS network using feedback and retransmissions. For ...
Martin Röder, Jean Cardinal, Raouf Hamzaoui
EUSFLAT
2009
194views Fuzzy Logic» more  EUSFLAT 2009»
13 years 5 months ago
A Fuzzy Particle Swarm Optimization Algorithm for a Cell Formation Problem
Group technology (GT) is a useful way to increase productivity with high quality in cellular manufacturing systems (CMSs), in which cell formation (CF) is a key step in the GT phil...
Esmaeil Mehdizadeh, Reza Tavakkoli-Moghaddam