2721 search results - page 276 / 545 » An experimental analysis of Lemke-Howson algorithm |
161
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
This paper introduces a novel analogy with the way in which honeybee colonies operate in order to solve the problem of sparse and quasi dense reconstruction. To successfully solve...
176
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
Both genetic algorithms (GAs) and temporal difference (TD) methods have proven effective at solving reinforcement learning (RL) problems. However, since few rigorous empirical com...
196
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
Finding latent patterns in high dimensional data is an important research problem with numerous applications. The most well known approaches for high dimensional data analysis are...
185
click to vote
CNIS
2006
15 years 8 months ago
2006
A variety of network security services, such as access control in firewalls and protocol analysis in intrusion detection systems, require the discrimination of packets based on th...
159
click to vote
SIGIR
2008
ACM
15 years 6 months ago
2008
ACM
Ranking algorithms, whose goal is to appropriately order a set of objects/documents, are an important component of information retrieval systems. Previous work on ranking algorith...