8540 search results - page 381 / 1708 » The Dynamic Servers Problem |
132
Voted
TCS
2008
15 years 4 months ago
2008
Online unit clustering is a clustering problem where classification of points is done in an online fashion, but the exact location of clusters can be modified dynamically. We stud...
133
click to vote
HIS
2008
15 years 6 months ago
2008
Artificial Neural Networks for online learning problems are often implemented with synaptic plasticity to achieve adaptive behaviour. A common problem is that the overall learning...
109
click to vote
AAAI
1994
15 years 5 months ago
1994
The paper evaluates the eectiveness of learning for speeding up the solution of constraint satisfaction problems. It extends previous work (Dechter 1990) by introducing a new and ...
139
Voted
CORR
2008
Springer
15 years 4 months ago
2008
Springer
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc...
152
click to vote
EC
2008
15 years 4 months ago
2008
The dynamic optimization problem concerns finding an optimum in a changing environment. In the field of evolutionary algorithms, this implies dealing with a timechanging fitness l...