Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
31
search results - page 7 / 7
»
Faster SAT solving with better CNF generation
Sort
relevance
views
votes
recent
update
View
thumb
title
153
click to vote
BMCBI
2010
116
views
more
BMCBI 2010
»
A hybrid approach to protein folding problem integrating constraint programming with local search
15 years 5 months ago
Download
www.biomedcentral.com
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...
Abu Zafer M. Dayem Ullah, Kathleen Steinhöfel
claim paper
Read More »
« Prev
« First
page 7 / 7
Last »
Next »