Sciweavers

3052 search results - page 3 / 611
» Weakly Distributive Domains
Sort
View
ATAL
2010
Springer
13 years 8 months ago
The multi variable multi constrained distributed constraint optimization framework
Service coordination in domains involving temporal constraints and duration uncertainty has previously been solved with a greedy algorithm that attempts to satisfy service requests...
Christopher Portway, Edmund H. Durfee
CASC
2006
Springer
128views Mathematics» more  CASC 2006»
13 years 11 months ago
New Domains for Applied Quantifier Elimination
We address various aspects of our computer algebra-based computer logic system redlog. There are numerous examples in the literature for successful applications of redlog to practi...
Thomas Sturm
COCO
2009
Springer
155views Algorithms» more  COCO 2009»
14 years 2 months ago
Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
Ronen Shaltiel
CONCUR
1995
Springer
13 years 11 months ago
Bisimulations for a Calculus of Broadcasting Systems
We develop a theory of bisimulation equivalence for the broadcast calculus CBS. Both the strong and weak versions of bisimulation congruence we study are justi ed in terms of a cha...
Matthew Hennessy, Julian Rathke
IJCAI
2007
13 years 8 months ago
Managing Domain Knowledge and Multiple Models with Boosting
We present MBoost, a novel extension to AdaBoost that extends boosting to use multiple weak learners explicitly, and provides robustness to learning models that overfit or are po...
Peng Zang, Charles Lee Isbell Jr.