Sciweavers

2824 search results - page 558 / 565
» Text Generation from Keywords
Sort
View
AAMAS
2008
Springer
14 years 9 months ago
Automated organization design for multi-agent systems
The ability to create effective multi-agent organizations is key to the development of larger, more diverse multi-agent systems. In this article we present KB-ORG: a fully automate...
Mark Sims, Daniel D. Corkill, Victor R. Lesser
BMCBI
2008
144views more  BMCBI 2008»
14 years 9 months ago
PDTD: a web-accessible protein database for drug target identification
Background: Target identification is important for modern drug discovery. With the advances in the development of molecular docking, potential binding proteins may be discovered b...
Zhenting Gao, Honglin Li, Hailei Zhang, Xiaofeng L...
78
Voted
CACM
2008
131views more  CACM 2008»
14 years 9 months ago
Exterminator: Automatically correcting memory errors with high probability
Programs written in C and C++ are susceptible to memory errors, including buffer overflows and dangling pointers. These errors, which can lead to crashes, erroneous execution, and...
Gene Novark, Emery D. Berger, Benjamin G. Zorn
BMCBI
2006
112views more  BMCBI 2006»
14 years 9 months ago
A phylogenomic gene cluster resource: the Phylogenetically Inferred Groups (PhIGs) database
Background: We present here the PhIGs database, a phylogenomic resource for sequenced genomes. Although many methods exist for clustering gene families, very few attempt to create...
Paramvir S. Dehal, Jeffrey L. Boore
CC
2007
Springer
121views System Software» more  CC 2007»
14 years 9 months ago
If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma