Sciweavers

1802 search results - page 125 / 361
» Complexity Theory for Operators in Analysis
Sort
View
GECCO
2008
Springer
156views Optimization» more  GECCO 2008»
15 years 7 months ago
Computing minimum cuts by randomized search heuristics
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
Frank Neumann, Joachim Reichel, Martin Skutella
ETS
2002
IEEE
116views Hardware» more  ETS 2002»
15 years 6 months ago
Human Activity Systems: A Theoretical Framework for Designing Learning for Multicultural Settings
In the analysis of any learning environment, whether small or large, one observes within it a "set of human activities related to each other so they can be viewed as a whole&...
Jill Slay
BMCBI
2010
145views more  BMCBI 2010»
15 years 6 months ago
WaveletQuant, an improved quantification software based on wavelet signal threshold de-noising for labeled quantitative proteomi
Background: Quantitative proteomics technologies have been developed to comprehensively identify and quantify proteins in two or more complex samples. Quantitative proteomics base...
Fan Mo, Qun Mo, Yuanyuan Chen, David R. Goodlett, ...
ATAL
2007
Springer
15 years 10 months ago
Model-based belief merging without distance measures
Merging operators try to define the beliefs of a group of agents according to the beliefs of each member of the group. Several model-based propositional belief merging operators h...
Verónica Borja Macías, Pilar Pozos P...
ARTMED
2000
105views more  ARTMED 2000»
15 years 6 months ago
Planning treatment of ischemic heart disease with partially observable Markov decision processes
Diagnosis of a disease and its treatment are not separate, one-shot activities. Instead, they are very often dependent and interleaved over time. This is mostly due to uncertainty...
Milos Hauskrecht, Hamish S. F. Fraser