Sciweavers

4224 search results - page 784 / 845
» Reasoning about Choice
Sort
View
LICS
2009
IEEE
15 years 5 months ago
Expressiveness and Closure Properties for Quantitative Languages
Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages L that assign to each word w a real number L(w). In ...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...
CIARP
2009
Springer
15 years 5 months ago
Analysis of the GRNs Inference by Using Tsallis Entropy and a Feature Selection Approach
Abstract. An important problem in the bioinformatics field is to understand how genes are regulated and interact through gene networks. This knowledge can be helpful for many appl...
Fabrício Martins Lopes, Evaldo A. de Olivei...
ICFEM
2009
Springer
15 years 5 months ago
Approximate Model Checking of PCTL Involving Unbounded Path Properties
Abstract. We study the problem of applying statistical methods for approximate model checking of probabilistic systems against properties encoded as PCTL formulas. Such approximate...
Samik Basu, Arka P. Ghosh, Ru He
ICFEM
2009
Springer
15 years 5 months ago
Combining Static Model Checking with Dynamic Enforcement Using the Statecall Policy Language
Internet protocols encapsulate a significant amount of state, making implementing the host software complex. In this paper, we define the Statecall Policy Language (SPL) which pr...
Anil Madhavapeddy
MDM
2009
Springer
269views Communications» more  MDM 2009»
15 years 5 months ago
R-U-In? - Exploiting Rich Presence and Converged Communications for Next-Generation Activity-Oriented Social Networking
—With the growing popularity of social networking, traditional Internet Service Providers (ISPs) and Telecom operators have both started exploring new opportunities to boost thei...
Nilanjan Banerjee, Dipanjan Chakraborty, Koustuv D...