Sciweavers

809 search results - page 15 / 162
» 04421 Abstracts Collection - Algebraic Methods in Computatio...
Sort
View
87
Voted
CSCLP
2005
Springer
15 years 3 months ago
A Hybrid Benders' Decomposition Method for Solving Stochastic Constraint Programs with Linear Recourse
Abstract. We adopt Benders’ decomposition algorithm to solve scenariobased Stochastic Constraint Programs (SCPs) with linear recourse. Rather than attempting to solve SCPs via a ...
Armagan Tarim, Ian Miguel
CSB
2005
IEEE
126views Bioinformatics» more  CSB 2005»
15 years 3 months ago
Discover True Association Rates in Multi-protein Complex Proteomics Data Sets
Experimental processes to collect and process proteomics data are increasingly complex, while the computational methods to assess the quality and significance of these data remain...
Changyu Shen, Lang Li, Jake Yue Chen
ATAL
2005
Springer
15 years 3 months ago
Allocation of indivisible goods: a general model and some complexity results
Many industrial or research activities are so expensive that it is often benefitable for the involved agents to cofund the construction or the purchase of a common required resou...
Sylvain Bouveret, Michel Lemaître, Hé...
ECCTD
2011
108views more  ECCTD 2011»
13 years 9 months ago
Low complexity least-squares filter design for the correction of linear time-varying systems
Abstract—In this paper, a low complexity algorithm for the design of a time-varying correction filter of finite impulse response (FIR) type is presented. Using the obtained fi...
Michael Soudan, Christian Vogel
91
Voted
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
15 years 1 months ago
Bounds for the computational power and learning complexity of analog neural nets
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
Wolfgang Maass