Sciweavers

4075 search results - page 261 / 815
» Modeling Distributed Algorithm Using B
Sort
View
SBMF
2009
Springer
126views Formal Methods» more  SBMF 2009»
15 years 11 months ago
Undecidability Results for Distributed Probabilistic Systems
Abstract. In the verification of concurrent systems involving probabilities, the aim is to find out the maximum/minimum probability that a given event occurs (examples of such ev...
Sergio Giro
TPDS
2010
135views more  TPDS 2010»
15 years 5 months ago
Maximizing Service Reliability in Distributed Computing Systems with Random Node Failures: Theory and Implementation
—In distributed computing systems (DCSs) where server nodes can fail permanently with nonzero probability, the system performance can be assessed by means of the service reliabil...
Jorge E. Pezoa, Sagar Dhakal, Majeed M. Hayat
WEA
2010
Springer
243views Algorithms» more  WEA 2010»
16 years 1 months ago
Experiments with a Feasibility Pump Approach for Nonconvex MINLPs
We present a new Feasibility Pump algorithm tailored for nonconvex Mixed Integer Nonlinear Programming problems. Differences with the previously proposed Feasibility Pump algorith...
Claudia D'Ambrosio, Antonio Frangioni, Leo Liberti...
CORR
2006
Springer
111views Education» more  CORR 2006»
15 years 6 months ago
An associative memory for the on-line recognition and prediction of temporal sequences
This paper presents the design of an associative memory with feedback that is capable of on-line temporal sequence learning. A framework for on-line sequence learning has been prop...
Joy Bose, Stephen B. Furber, Jonathan L. Shapiro
KDD
2006
ACM
129views Data Mining» more  KDD 2006»
16 years 7 months ago
Suppressing model overfitting in mining concept-drifting data streams
Mining data streams of changing class distributions is important for real-time business decision support. The stream classifier must evolve to reflect the current class distributi...
Haixun Wang, Jian Yin, Jian Pei, Philip S. Yu, Jef...