Sciweavers

2560 search results - page 189 / 512
» Contributions to zero-sum problems
Sort
View
SODA
2008
ACM
110views Algorithms» more  SODA 2008»
15 years 2 months ago
Fast asynchronous byzantine agreement and leader election with full information
We resolve two long-standing open problems in distributed computation by describing polylogarithmic protocols for Byzantine agreement and leader election in the asynchronous full ...
Bruce M. Kapron, David Kempe, Valerie King, Jared ...
130
Voted
OPODIS
2007
15 years 2 months ago
Brute-Force Determination of Multiprocessor Schedulability for Sets of Sporadic Hard-Deadline Tasks
This report describes a necessary and sufficient test for the schedulability of a set of sporadic harddeadline tasks on a multiprocessor platform, using any of a variety of schedu...
Theodore P. Baker, Michele Cirinei
86
Voted
SDM
2007
SIAM
81views Data Mining» more  SDM 2007»
15 years 2 months ago
A PAC Bound for Approximate Support Vector Machines
We study a class of algorithms that speed up the training process of support vector machines (SVMs) by returning an approximate SVM. We focus on algorithms that reduce the size of...
Dongwei Cao, Daniel Boley
82
Voted
AAAI
2004
15 years 2 months ago
Machine Learning for Fast Quadrupedal Locomotion
For a robot, the ability to get from one place to another is one of the most basic skills. However, locomotion on legged robots is a challenging multidimensional control problem. ...
Nate Kohl, Peter Stone
86
Voted
AAAI
2006
15 years 2 months ago
Cost-Optimal External Planning
This paper considers strategies for external memory based optimal planning. An external breadth-first search exploration algorithm is devised that is guaranteed to find the costop...
Stefan Edelkamp, Shahid Jabbar