Sciweavers

258 search results - page 23 / 52
» Weak Bisimulation Approximants
Sort
View
ENTCS
2008
97views more  ENTCS 2008»
14 years 12 months ago
An Algorithm for Approximating the Satisfiability Problem of High-level Conditions
The satisfiability problem is the fundamental problem in proving the conflict-freeness of specifications, or in finding a counterexample for an invalid statement. In this paper, w...
Karl-Heinz Pennemann
JAT
2010
80views more  JAT 2010»
14 years 10 months ago
The Bregman distance, approximate compactness and convexity of Chebyshev sets in Banach spaces
We present some sufficient conditions ensuring the upper semicontinuity and the continuity of the Bregman projection operator Π g C and the relative projection operator P g C in...
Chong Li, Wen Song, Jen-Chih Yao
COLT
1999
Springer
15 years 4 months ago
Boosting as Entropy Projection
We consider the AdaBoost procedure for boosting weak learners. In AdaBoost, a key step is choosing a new distribution on the training examples based on the old distribution and th...
Jyrki Kivinen, Manfred K. Warmuth
LICS
2012
IEEE
13 years 2 months ago
A Higher-Order Distributed Calculus with Name Creation
—This paper introduces HOpiPn, the higher-order pi-calculus with passivation and name creation, and develops an equivalence theory for this calculus. Passivation [Schmitt and Ste...
Adrien Piérard, Eijiro Sumii
QUESTA
2008
205views more  QUESTA 2008»
14 years 11 months ago
Continuity of the M/G/c queue
Consider an M/G/c queue with homogeneous servers and service time distribution F. It is shown that an approximation of the service time distribution F by stochastically smaller di...
Lothar Breuer