Sciweavers

1968 search results - page 121 / 394
» The Complexity of Valued Constraint Models
Sort
View
LICS
2006
IEEE
15 years 7 months ago
On Model-Checking Trees Generated by Higher-Order Recursion Schemes
We prove that the modal mu-calculus model-checking problem for (ranked and ordered) node-labelled trees that are generated by order-n recursion schemes (whether safe or not, and w...
C.-H. Luke Ong
CLEIEJ
2002
156views more  CLEIEJ 2002»
15 years 1 months ago
A Fuzzy Model for Function Point Analysis to Development and Enhancement Project Assessments
Function Point Analysis (FPA) is among the most commonly used techniques to estimate the size of software system projects or software systems. During the point counting process th...
Osias de Souza Lima Júnior, Pedro Porf&iacu...
CSDA
2007
134views more  CSDA 2007»
15 years 1 months ago
Variational approximations in Bayesian model selection for finite mixture distributions
Variational methods for model comparison have become popular in the neural computing/machine learning literature. In this paper we explore their application to the Bayesian analys...
Clare A. McGrory, D. M. Titterington
ICPPW
2006
IEEE
15 years 7 months ago
Model Checking Control Communication of a FACTS Device
This paper concerns the design and verification of a realtime communication protocol for sensor data collection and processing between an embedded computer and a DSP. In such sys...
David A. Cape, Bruce M. McMillin, James K. Townsen...
ICTAC
2005
Springer
15 years 7 months ago
Symbolic Model Checking of Finite Precision Timed Automata
Abstract. This paper introduces the notion of finite precision timed automata (FPTAs) and proposes a data structure to represent its symbolic states. To reduce the state space, FP...
Rongjie Yan, Guangyuan Li, Zhisong Tang