Sciweavers

61 search results - page 6 / 13
» An empirical study of a scalable Byzantine agreement algorit...
Sort
View
ALDT
2009
Springer
142views Algorithms» more  ALDT 2009»
14 years 2 months ago
Finding Best k Policies
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
Peng Dai, Judy Goldsmith
COOPIS
2004
IEEE
13 years 11 months ago
Eager Replication for Stateful J2EE Servers
Abstract. Replication has been widely used in J2EE servers for reliability and scalability. There are two properties which are important for a stateful J2EE application server. Fir...
Huaigu Wu, Bettina Kemme, Vance Maverick
JAISE
2010
163views Algorithms» more  JAISE 2010»
13 years 2 months ago
Affective negotiation support systems
Negotiation is a process in which two or more parties aim to reach a joint agreement. As such negotiation involves rational decision making about options and issues. However, negot...
Joost Broekens, Catholijn M. Jonker, John-Jules Ch...
NIPS
2007
13 years 8 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...
NIPS
2008
13 years 8 months ago
Learning the Semantic Correlation: An Alternative Way to Gain from Unlabeled Text
In this paper, we address the question of what kind of knowledge is generally transferable from unlabeled text. We suggest and analyze the semantic correlation of words as a gener...
Yi Zhang 0010, Jeff Schneider, Artur Dubrawski