Sciweavers

2214 search results - page 172 / 443
» Complexity of Reasoning
Sort
View
BMCBI
2008
106views more  BMCBI 2008»
15 years 3 months ago
Identification of hot-spot residues in protein-protein interactions by computational docking
Background: The study of protein-protein interactions is becoming increasingly important for biotechnological and therapeutic reasons. We can define two major areas therein: the s...
Solène Grosdidier, Juan Fernández-Re...
129
Voted
CCGRID
2002
IEEE
15 years 8 months ago
Towards an Economy-Based Optimisation of File Access and Replication on a Data Grid
We are working on a system for the optimised access and replication of data on a Data Grid. Our approach is based on the use of an economic model that includes the actors and the ...
Mark James Carman, Floriano Zini, Luciano Serafini...
155
Voted
UAI
2008
15 years 5 months ago
Model-Based Bayesian Reinforcement Learning in Large Structured Domains
Model-based Bayesian reinforcement learning has generated significant interest in the AI community as it provides an elegant solution to the optimal exploration-exploitation trade...
Stéphane Ross, Joelle Pineau
128
Voted
TASE
2008
IEEE
15 years 3 months ago
Event-B Specification of a Situated Multi-Agent System: Study of a Platoon of Vehicles
Situated Multi-Agents Systems (MAS), and other Agentbased systems, are often complex. Formal reasoning is needed to ensuring their correctness and structuring their development. E...
Arnaud Lanoix
156
Voted
ATAL
2010
Springer
15 years 4 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