5692 search results - page 113 / 1139 » Challenges and Unsolved Problems |
124
click to vote
CADE
2012
Springer
13 years 3 months ago
2012
Springer
We propose a word level, bounded model checking (BMC) algorithm based on translation into the effectively propositional fragment (EPR) of firstorder logic. This approach to BMC al...
102
click to vote
BMCBI
2010
15 years 25 days ago
2010
Background: The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of lattice structure and energy func...
118
Voted
SIAMCOMP
2008
15 years 19 days ago
2008
We develop approximation algorithms for the problem of placing replicated data in arbitrary networks, where the nodes may both issue requests for data objects and have capacity fo...
115
Voted
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
The protein folding problem consists of predicting the functional (native) structure of the protein given its linear sequence of amino acids. Despite extensive progress made in un...
111
click to vote
CCR
2005
15 years 19 days ago
2005
There exist a wide variety of network design problems that require a traffic matrix as input in order to carry out performance evaluation. The research community has not had at it...