Sciweavers

4835 search results - page 850 / 967
» Refactoring Functional Programs
Sort
View
IJON
2006
146views more  IJON 2006»
13 years 9 months ago
Feature selection and classification using flexible neural tree
The purpose of this research is to develop effective machine learning or data mining techniques based on flexible neural tree FNT. Based on the pre-defined instruction/operator se...
Yuehui Chen, Ajith Abraham, Bo Yang
CORR
2007
Springer
104views Education» more  CORR 2007»
13 years 9 months ago
Separable convex optimization problems with linear ascending constraints
Separable convex optimization problems with linear ascending inequality and equality constraints are addressed in this paper. An algorithm that explicitly characterizes the optimum...
Arun Padakandla, Rajesh Sundaresan
JPDC
2008
122views more  JPDC 2008»
13 years 9 months ago
Stochastic robustness metric and its use for static resource allocations
This research investigates the problem of robust static resource allocation for distributed computing systems operating under imposed Quality of Service (QoS) constraints. Often, ...
Vladimir Shestak, Jay Smith, Anthony A. Maciejewsk...
JCC
2006
82views more  JCC 2006»
13 years 9 months ago
Monte Carlo simulations of biomolecules: The MC module in CHARMM
: We describe the implementation of a general and flexible Monte Carlo (MC) module for the program CHARMM, which is used widely for modeling biomolecular systems with empirical ene...
Jie Hu, Ao Ma, Aaron R. Dinner
JFP
2006
113views more  JFP 2006»
13 years 9 months ago
Efficient manipulation of binary data using pattern matching
Pattern matching is an important operation in functional programs. So far, pattern matching has been investigated in the context of structured terms. This article presents an appr...
Per Gustafsson, Konstantinos F. Sagonas