Sciweavers

5158 search results - page 229 / 1032
» Generalization of the Dempster-Shafer Theory
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
GPCE
2008
Springer
15 years 7 months ago
Typing communicating component assemblages
Building complex component-based software architectures can lead to subtle assemblage errors. In this paper, we introduce a typesystem-based approach to avoid message handling err...
Michael Lienhardt, Alan Schmitt, Jean-Bernard Stef...
ICML
2010
IEEE
15 years 7 months ago
On the Interaction between Norm and Dimensionality: Multiple Regimes in Learning
A learning problem might have several measures of complexity (e.g., norm and dimensionality) that affect the generalization error. What is the interaction between these complexiti...
Percy Liang, Nati Srebro
APAL
2007
63views more  APAL 2007»
15 years 6 months ago
Bounded functional interpretation and feasible analysis
In this article we study applications of the bounded functional interpretation to theories of feasible arithmetic and analysis. The main results show that the novel interpretation...
Fernando Ferreira, Paulo Oliva
BMCBI
2008
111views more  BMCBI 2008»
15 years 6 months ago
Aspects of coverage in medical DNA sequencing
Background: DNA sequencing is now emerging as an important component in biomedical studies of diseases like cancer. Short-read, highly parallel sequencing instruments are expected...
Michael C. Wendl, Richard K. Wilson