Sciweavers

3495 search results - page 321 / 699
» On the random satisfiable process
Sort
View
LOGCOM
2010
87views more  LOGCOM 2010»
15 years 5 months ago
Exemplaric Expressivity of Modal Logics
Abstract This paper investigates expressivity of modal logics for transition systems, multitransition systems, Markov chains, and Markov processes, as coalgebras of the powerset, ï...
Bart Jacobs, Ana Sokolova
PIMRC
2010
IEEE
15 years 4 months ago
A green software-defined communication processor for dynamic spectrum access
Abstract--Dynamic spectrum access (DSA) supporting opportunistic transmission without extra spectrum bandwidth is attractive for future wireless communication. To facilitate such D...
Ching-Kai Liang, Kwang-Cheng Chen
ECSQARU
2009
Springer
15 years 4 months ago
Can the Minimum Rule of Possibility Theory Be Extended to Belief Functions?
Abstract. When merging belief functions, Dempster rule of combination is justified only when sources can be considered as independent. When dependencies are ill-known, it is usual ...
Sébastien Destercke, Didier Dubois
CORR
2010
Springer
121views Education» more  CORR 2010»
15 years 4 months ago
A Framework for Constraint-Based Deployment and Autonomic Management of Distributed Applications
We propose a framework for deployment and subsequent autonomic management of component-based distributed applications. An initial deployment goal is specified using a declarative ...
Alan Dearle, Graham N. C. Kirby, Andrew McCarthy
CORR
2010
Springer
147views Education» more  CORR 2010»
15 years 4 months ago
Matching Dependencies with Arbitrary Attribute Values: Semantics, Query Answering and Integrity Constraints
Matching dependencies (MDs) are used to declaratively specify the identification (or matching) of certain attribute values in pairs of database tuples when some similarity conditi...
Jaffer Gardezi, Leopoldo E. Bertossi, Iluju Kiring...