Sciweavers

5580 search results - page 334 / 1116
» Randomized priority algorithms
Sort
View
SSS
2010
Springer
125views Control Systems» more  SSS 2010»
15 years 4 months ago
Systematic Correct Construction of Self-stabilizing Systems: A Case Study
Design and implementation of distributed algorithms often involve many subtleties due to their complex structure, non-determinism, and low atomicity as well as occurrence of unanti...
Ananda Basu, Borzoo Bonakdarpour, Marius Bozga, Jo...
DLOG
2009
15 years 4 months ago
A Conflict-based Operator for Mapping Revision
Ontology matching is one of the key research topics in the field of the Semantic Web. There are many matching systems that generate mappings between different ontologies either aut...
Guilin Qi, Qiu Ji, Peter Haase
TON
2010
139views more  TON 2010»
15 years 1 months ago
Opportunistic and Cooperative Spatial Multiplexing in MIMO Ad Hoc Networks
With the fast progress of MIMO technology and its growing applications in networks, it is important to develop techniques to enable more efficient MIMO network communications. Howe...
Shan Chu, Xin Wang
STACS
2012
Springer
14 years 2 months ago
The Denjoy alternative for computable functions
The Denjoy-Young-Saks Theorem from classical analysis states that for an arbitrary function f : R → R, the Denjoy alternative holds outside a null set, i.e., for almost every re...
Laurent Bienvenu, Rupert Hölzl, Joseph S. Mil...
ICMLA
2008
15 years 8 months ago
Decision Tree Ensemble: Small Heterogeneous Is Better Than Large Homogeneous
Using decision trees that split on randomly selected attributes is one way to increase the diversity within an ensemble of decision trees. Another approach increases diversity by ...
Michael Gashler, Christophe G. Giraud-Carrier, Ton...