Sciweavers

223 search results - page 36 / 45
» Improved Generic Algorithms for 3-Collisions
Sort
View
POPL
1989
ACM
13 years 11 months ago
How to Make ad-hoc Polymorphism Less ad-hoc
raction that a programming language provides influences the structure and algorithmic complexity of the resulting programs: just imagine creating an artificial intelligence engine ...
Philip Wadler, Stephen Blott
BMCBI
2010
116views more  BMCBI 2010»
13 years 7 months ago
A hybrid approach to protein folding problem integrating constraint programming with local search
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
CORR
2008
Springer
139views Education» more  CORR 2008»
13 years 7 months ago
Exact two-terminal reliability of some directed networks
Abstract-- The calculation of network reliability in a probabilistic context has long been an issue of practical and academic importance. Conventional approaches (determination of ...
Christian Tanguy
NN
2008
Springer
152views Neural Networks» more  NN 2008»
13 years 7 months ago
Analysis of the IJCNN 2007 agnostic learning vs. prior knowledge challenge
We organized a challenge for IJCNN 2007 to assess the added value of prior domain knowledge in machine learning. Most commercial data mining programs accept data pre-formatted in ...
Isabelle Guyon, Amir Saffari, Gideon Dror, Gavin C...
IPM
2007
145views more  IPM 2007»
13 years 7 months ago
Text mining techniques for patent analysis
Patent documents contain important research results. However, they are lengthy and rich in technical terminology such that it takes a lot of human efforts for analyses. Automatic...
Yuen-Hsien Tseng, Chi-Jen Lin, Yu-I Lin