Sciweavers

491 search results - page 97 / 99
» Exploration method using harmonic functions
Sort
View
GECCO
2007
Springer
241views Optimization» more  GECCO 2007»
14 years 1 months ago
Binary ant algorithm
When facing dynamic optimization problems the goal is no longer to find the extrema, but to track their progression through the space as closely as possible. Over these kind of ov...
Carlos Fernandes, Agostinho C. Rosa, Vitorino Ramo...
INFOCOM
2005
IEEE
14 years 1 months ago
IPStash: a set-associative memory approach for efficient IP-lookup
—IP-Lookup is a challenging problem because of the increasing routing table sizes, increased traffic, and higher speed links. These characteristics lead to the prevalence of hard...
Stefanos Kaxiras, Georgios Keramidas
BMCBI
2007
160views more  BMCBI 2007»
13 years 7 months ago
Identifying protein complexes directly from high-throughput TAP data with Markov random fields
Background: Predicting protein complexes from experimental data remains a challenge due to limited resolution and stochastic errors of high-throughput methods. Current algorithms ...
Wasinee Rungsarityotin, Roland Krause, Arno Sch&ou...
BMCBI
2004
150views more  BMCBI 2004»
13 years 7 months ago
Graph-based iterative Group Analysis enhances microarray interpretation
Background: One of the most time-consuming tasks after performing a gene expression experiment is the biological interpretation of the results by identifying physiologically impor...
Rainer Breitling, Anna Amtmann, Pawel Herzyk
SIGSOFT
2004
ACM
14 years 8 months ago
Reasoning about partial goal satisfaction for requirements and design engineering
Exploring alternative options is at the heart of the requirements and design processes. Different alternatives contribute to different degrees of achievement of non-functional goa...
Emmanuel Letier, Axel van Lamsweerde