6455 search results - page 882 / 1291 » Research problems |
172
click to vote
PPSC
1993
15 years 8 months ago
1993
The dense nonsymmetric eigenproblem is one of the hardest linear algebra problems to solvee ectively on massivelyparallel machines. Rather than trying to design a black box" ...
185
click to vote
SODA
1992
ACM
15 years 8 months ago
1992
ACM
We present several applications in computational geometry of Megiddo's parametric searching technique. These applications include: (1) Finding the minimum Hausdorff distance ...
190
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
This paper describes an algorithm, called CQ-learning, which learns to adapt the state representation for multi-agent systems in order to coordinate with other agents. We propose ...
173
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
While John Holland has always envisioned learning classifier systems (LCSs) as cognitive systems, most work on LCSs has focused on classification, datamining, and function appro...
166
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
There is a number of recent research lines addressing complex negotiations in highly rugged utility spaces. However, most of them focus on overcoming the problems imposed by the c...