Sciweavers

1059 search results - page 81 / 212
» Improved Algorithms via Approximations of Probability Distri...
Sort
View
NIPS
2007
14 years 11 months ago
Parallelizing Support Vector Machines on Distributed Computers
Support Vector Machines (SVMs) suffer from a widely recognized scalability problem in both memory use and computational time. To improve scalability, we have developed a parallel ...
Edward Y. Chang, Kaihua Zhu, Hao Wang, Hongjie Bai...
ATAL
2008
Springer
14 years 11 months ago
Emerging coordination in infinite team Markov games
In this paper we address the problem of coordination in multi-agent sequential decision problems with infinite statespaces. We adopt a game theoretic formalism to describe the int...
Francisco S. Melo, M. Isabel Ribeiro
ATAL
2003
Springer
15 years 3 months ago
Robust software via agent-based redundancy
This paper describes how multiagent systems can be used to achieve robust software, one of the major goals of software engineering. The paper first positions itself within the sof...
Michael N. Huhns, Vance T. Holderfield, Rosa Laura...
SPIRE
2001
Springer
15 years 2 months ago
Exact Distribution of Deletion Sizes for Unavoidable Strings
We constructively prove the exact distribution of deletion sizes for unavoidable strings, under the reductive decidability method of Zimin and Bean et al. Bounds such as these on ...
Christine E. Heitsch
ICPP
2006
IEEE
15 years 3 months ago
A Parallel External-Memory Frontier Breadth-First Traversal Algorithm for Clusters of Workstations
— This paper presents a parallel external-memory algorithm for performing a breadth-first traversal of an implicit graph on a cluster of workstations. The algorithm is a paralle...
Robert Niewiadomski, José Nelson Amaral, Ro...