Sciweavers

159 search results - page 29 / 32
» Making the Most of IT Governance Software: Understanding Imp...
Sort
View
GECCO
2007
Springer
211views Optimization» more  GECCO 2007»
14 years 1 months ago
An extremal optimization search method for the protein folding problem: the go-model example
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...
Alena Shmygelska
CCO
2001
Springer
161views Combinatorics» more  CCO 2001»
13 years 12 months ago
Branch, Cut, and Price: Sequential and Parallel
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
Laszlo Ladányi, Ted K. Ralphs, Leslie E. Tr...
BMCBI
2006
160views more  BMCBI 2006»
13 years 7 months ago
MIMAS: an innovative tool for network-based high density oligonucleotide microarray data management and annotation
Background: The high-density oligonucleotide microarray (GeneChip) is an important tool for molecular biological research aiming at large-scale detection of small nucleotide polym...
Leandro Hermida, Olivier Schaad, Philippe Demougin...
IPCCC
2007
IEEE
14 years 1 months ago
Optimising Networks Against Malware
Rapidly-spreading malicious software is an important threat on today’s computer networks. Most solutions that have been proposed to counter this threat are based on our ability ...
Pierre-Marc Bureau, José M. Fernandez
CCS
2009
ACM
14 years 2 months ago
Large-scale malware indexing using function-call graphs
A major challenge of the anti-virus (AV) industry is how to effectively process the huge influx of malware samples they receive every day. One possible solution to this problem i...
Xin Hu, Tzi-cker Chiueh, Kang G. Shin