Sciweavers

10848 search results - page 1758 / 2170
» Programming in Biomolecular Computation
Sort
View
JCC
2006
103views more  JCC 2006»
15 years 6 months ago
Flooding in GROMACS: Accelerated barrier crossings in molecular dynamics
: The major bottleneck of today's atomistic molecular dynamics (MD) simulations is that because of the enormous computational effort involved, only processes at nanoseconds to...
Oliver F. Lange, Lars V. Schäfer, Helmut Grub...
DISOPT
2007
93views more  DISOPT 2007»
15 years 6 months ago
A feasibility pump heuristic for general mixed-integer problems
Finding a feasible solution of a given Mixed-Integer Programming (MIP) model is a very important (NP-complete) problem that can be extremely hard in practice. Very recently, Fisch...
Livio Bertacco, Matteo Fischetti, Andrea Lodi
JSW
2008
220views more  JSW 2008»
15 years 6 months ago
Empirical validation of Software development effort multipliers of Intermediate COCOMO Model
Intermediate COCOMO Model computes effort as a function of program size and a set of cost drivers. Effort adjustment factor (EAF) is calculated using 15 cost drivers. EAF is an imp...
M. J. Basavaraj, K. C. Shet
JMLR
2006
105views more  JMLR 2006»
15 years 6 months ago
Parallel Software for Training Large Scale Support Vector Machines on Multiprocessor Systems
Parallel software for solving the quadratic program arising in training support vector machines for classification problems is introduced. The software implements an iterative dec...
Luca Zanni, Thomas Serafini, Gaetano Zanghirati
JSAT
2006
88views more  JSAT 2006»
15 years 6 months ago
On Using Cutting Planes in Pseudo-Boolean Optimization
Cutting planes are a well-known, widely used, and very effective technique for Integer Linear Programming (ILP). However, cutting plane techniques are seldom used in PseudoBoolean...
Vasco M. Manquinho, João P. Marques Silva
« Prev « First page 1758 / 2170 Last » Next »