Sciweavers

2273 search results - page 189 / 455
» On the Expressiveness and Complexity of ATL
Sort
View
BMCBI
2011
15 years 1 months ago
Using Stochastic Causal Trees to Augment Bayesian Networks for Modeling eQTL Datasets
Background: The combination of genotypic and genome-wide expression data arising from segregating populations offers an unprecedented opportunity to model and dissect complex phen...
Kyle C. Chipman, Ambuj K. Singh
ALGOSENSORS
2009
Springer
16 years 1 months ago
Link Reversal: How to Play Better to Work Less
Sensor networks, with their ad hoc deployments, node mobility, and wireless communication, pose serious challenges for developing provably correct and efficient applications. A po...
Bernadette Charron-Bost, Jennifer L. Welch, Josef ...
CAISE
2006
Springer
15 years 10 months ago
Compliant and Flexible Business Processes with Business Rules
When modeling business processes, we often implicity think of internal business policies and external regulations. Yet to date, little attention is paid to avoid hard-coding polici...
Stijn Goedertier, Jan Vanthienen
ATAL
2010
Springer
15 years 7 months ago
Pure Nash equilibria: complete characterization of hard and easy graphical games
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
Albert Xin Jiang, MohammadAli Safari
AI
2008
Springer
15 years 6 months ago
What makes propositional abduction tractable
Abduction is a fundamental form of nonmonotonic reasoning that aims at finding explanations for observed manifestations. This process underlies many applications, from car configu...
Gustav Nordh, Bruno Zanuttini