Sciweavers

5075 search results - page 759 / 1015
» Convergence
Sort
View
PODC
2000
ACM
15 years 10 months ago
Efficient atomic broadcast using deterministic merge
We present an approach for merging message streams from producers distributed over a network, using a deterministic algorithm that is independent of any nondeterminism of the syst...
Marcos Kawazoe Aguilera, Robert E. Strom
EUROCOLT
1997
Springer
15 years 10 months ago
Ordinal Mind Change Complexity of Language Identification
The approach of ordinal mind change complexity, introduced by Freivalds and Smith, uses (notations for) constructive ordinals to bound the number of mind changes made by a learnin...
Andris Ambainis, Sanjay Jain, Arun Sharma
COLT
1995
Springer
15 years 10 months ago
A Comparison of New and Old Algorithms for a Mixture Estimation Problem
We investigate the problem of estimating the proportion vector which maximizes the likelihood of a given sample for a mixture of given densities. We adapt a framework developed for...
David P. Helmbold, Yoram Singer, Robert E. Schapir...
HYBRID
1997
Springer
15 years 10 months ago
On-Line, Reflexive Constraint Satisfaction for Hybrid Systems: First Steps
Abstract. We can achieve guaranteed constraint satisfaction of a hybrid dynamical system (which takes into account the underlying continuous dynamics) in a simple, hierarchical con...
Michael S. Branicky
FPGA
1995
ACM
149views FPGA» more  FPGA 1995»
15 years 10 months ago
PathFinder: A Negotiation-based Performance-driven Router for FPGAs
Routing FPGAs is a challenging problem because of the relative scarcity of routing resources, both wires and connection points. This can lead either to slow implementations caused...
Larry McMurchie, Carl Ebeling