Sciweavers

1132 search results - page 63 / 227
» Structural Average Case Complexity
Sort
View
ATAL
2009
Springer
14 years 3 months ago
Easy and hard coalition resource game formation problems: a parameterized complexity analysis
Coalition formation is a key topic in multi–agent systems (mas). Coalitions enable agents to achieve goals that they may not have been able to achieve independently, and encoura...
Tammar Shrot, Yonatan Aumann, Sarit Kraus
BMCBI
2007
102views more  BMCBI 2007»
13 years 8 months ago
Setting up a large set of protein-ligand PDB complexes for the development and validation of knowledge-based docking algorithms
Background: The number of algorithms available to predict ligand-protein interactions is large and ever-increasing. The number of test cases used to validate these methods is usua...
Luis A. Diago, Persy Morell, Longendri Aguilera, E...
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
14 years 2 months ago
The computational complexity of nash equilibria in concisely represented games
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...
Grant Schoenebeck, Salil P. Vadhan
CAD
2006
Springer
13 years 9 months ago
An efficient, error-bounded approximation algorithm for simulating quasi-statics of complex linkages
Design and analysis of articulated mechanical structures, commonly referred to as linkages, is an integral part of any CAD/CAM system. The most common approaches formulate the pro...
Stephane Redon, Ming C. Lin
BMCBI
2008
121views more  BMCBI 2008»
13 years 9 months ago
OntoDas - a tool for facilitating the construction of complex queries to the Gene Ontology
Background: Ontologies such as the Gene Ontology can enable the construction of complex queries over biological information in a conceptual way, however existing systems to do thi...
Kieran O'Neill, Alexander García Castro, An...