Sciweavers

9842 search results - page 305 / 1969
» Problem complexity
Sort
View
BMCBI
2010
156views more  BMCBI 2010»
15 years 7 months ago
Protein complex prediction via verifying and reconstructing the topology of domain-domain interactions
Background: High-throughput methods for detecting protein-protein interactions enable us to obtain large interaction networks, and also allow us to computationally identify the as...
Yosuke Ozawa, Rintaro Saito, Shigeo Fujimori, Hisa...
WCE
2007
15 years 8 months ago
Solution of Supersonic Internal Flow Problems Using MFDV
— The FDV method was originally developed by T.J. Chung [3]-[6]. The authors developed and presented a modification to this method named MFDV method in [2]. The aim of this modif...
A. A. Megahed, M. W. El-Mallah, B. R. Girgis
ECAI
2006
Springer
15 years 10 months ago
AI and Music: Toward a Taxonomy of Problem Classes
The application of Artificial Intelligence technology to the field of music has always been fascinating, from the first attempts in automating human problem solving behavior till t...
Oliver Kramer, Benno Stein, Jürgen Wall
STOC
2002
ACM
91views Algorithms» more  STOC 2002»
16 years 7 months ago
New results on monotone dualization and generating hypergraph transversals
This paper considers the problem of dualizing a monotone CNF (equivalently, computing all minimal transversals of a hypergraph), whose associated decision problem is a prominent o...
Thomas Eiter, Georg Gottlob, Kazuhisa Makino
CSR
2007
Springer
16 years 29 days ago
Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen