1484 search results - page 83 / 297 » Ants meeting algorithms |
ICDM
2010
IEEE
14 years 7 months ago
2010
IEEE
Whenever a dataset has multiple discrete target variables, we want our algorithms to consider not only the variables themselves, but also the interdependencies between them. We pro...
112
click to vote
SIGMOD
2011
ACM
14 years 21 days ago
2011
ACM
Due to the complexity of graph query languages, the need for visual query interfaces that can reduce the burden of query formulation is fundamental to the spreading of graph data ...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
We discuss testing methods for exposing origin-seeking bias in PSO motion algorithms. The strategy of resizing the initialization space, proposed by Gehlhaar and Fogel and made po...
CSCW
2010
ACM
15 years 6 months ago
2010
ACM
People are often required to catch up on information they have missed in meetings, because of lateness or scheduling conflicts. Catching up is a complex cognitive process where pe...
AAAI
2000
14 years 11 months ago
2000
Models for sequential decision making under uncertainty (e.g., Markov decision processes,or MDPs) have beenstudied in operations research for decades. The recent incorporation of ...