1155 search results - page 199 / 231 » Continuous dynamic problem generators for evolutionary algor... |
106
Voted
GECCO
2010
Springer
15 years 2 months ago
2010
Springer
Developing dispatching rules for manufacturing systems is a tedious process, which is time- and cost-consuming. Since there is no good general rule for different scenarios and ob...
130
click to vote
CIAC
1994
Springer
15 years 4 months ago
1994
Springer
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...
103
click to vote
ROBOCUP
1999
Springer
15 years 4 months ago
1999
Springer
The underlying research topics and the architecture of the UBU team are briefly described. The aim of developing UBU is to subject a series of tools and procedures for agent decis...
119
click to vote
DCOSS
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
127
Voted
TIP
2008
15 years 11 days ago
2008
In this paper, we present an automatic classification framework combining appearance based features and Hidden Markov Models (HMM) to detect unusual events in image sequences. One...