Sciweavers

486 search results - page 46 / 98
» Improved upper bounds for 3-SAT
Sort
View
MSWIM
2004
ACM
15 years 3 months ago
Scalable simulation of large-scale wireless networks with bounded inaccuracies
Discrete event network simulators have emerged as popular tools for verification and performance evaluation for various wireless networks. Nevertheless, the desire to model such ...
Zhengrong Ji, Junlan Zhou, Mineo Takai, Rajive Bag...
RTCSA
2009
IEEE
15 years 4 months ago
Branch Target Buffers: WCET Analysis Framework and Timing Predictability
—One step in the verification of hard real-time systems is to determine upper bounds on the worst-case execution times (WCET) of tasks. To obtain tight bounds, a WCET analysis h...
Daniel Grund, Jan Reineke, Gernot Gebhard
ICML
2008
IEEE
15 years 10 months ago
Estimating local optimums in EM algorithm over Gaussian mixture model
EM algorithm is a very popular iteration-based method to estimate the parameters of Gaussian Mixture Model from a large observation set. However, in most cases, EM algorithm is no...
Zhenjie Zhang, Bing Tian Dai, Anthony K. H. Tung
FORMATS
2009
Springer
15 years 1 months ago
Stochastic Games for Verification of Probabilistic Timed Automata
Probabilistic timed automata (PTAs) are used for formal modelling and verification of systems with probabilistic, nondeterministic and real-time behaviour. For non-probabilistic ti...
Marta Z. Kwiatkowska, Gethin Norman, David Parker
ESA
2009
Springer
127views Algorithms» more  ESA 2009»
15 years 4 months ago
Piercing Translates and Homothets of a Convex Body
According to a classical result of Gr¨unbaum, the transversal number τ(F) of any family F of pairwise-intersecting translates or homothets of a convex body C in Rd is bounded by...
Adrian Dumitrescu, Minghui Jiang