2412 search results - page 351 / 483 » Which Problems Have Strongly Exponential Complexity |
JCC
2006
13 years 9 months ago
2006
: This article describes a method for solving the geometric closure problem for simplified models of nucleic acid structures by using the constant bond lengths approximation. The r...
SIGCSE
2004
ACM
14 years 2 months ago
2004
ACM
Many algorithm visualizations have been created, but little is known about which features are most important to their success. We believe that pedagogically useful visualizations ...
BMCBI
2008
13 years 9 months ago
2008
Background: Graphs and networks are common analysis representations for biological systems. Many traditional graph algorithms such as k-clique, k-coloring, and subgraph matching h...
AAMAS
2005
Springer
13 years 9 months ago
2005
Springer
Cooperative multi-agent systems are ones in which several agents attempt, through their interaction, to jointly solve tasks or to maximize utility. Due to the interactions among t...
SIGECOM
2005
ACM
14 years 2 months ago
2005
ACM
The family of Vickrey-Clarke-Groves (VCG) mechanisms is arguably the most celebrated achievement in truthful mechanism design. However, VCG mechanisms have their limitations. They...