Sciweavers

1310 search results - page 244 / 262
» On a Class of Traceability Codes
Sort
View
AI
2006
Springer
13 years 7 months ago
Cut-and-solve: An iterative search strategy for combinatorial optimization problems
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...
Sharlee Climer, Weixiong Zhang
BMCBI
2006
150views more  BMCBI 2006»
13 years 7 months ago
Predicting protein subcellular locations using hierarchical ensemble of Bayesian classifiers based on Markov chains
Background: The subcellular location of a protein is closely related to its function. It would be worthwhile to develop a method to predict the subcellular location for a given pr...
Alla Bulashevska, Roland Eils
DM
2006
128views more  DM 2006»
13 years 7 months ago
Non-trivial t-designs without repeated blocks exist for all t
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
Luc Teirlinck
JMLR
2006
108views more  JMLR 2006»
13 years 7 months ago
The Interplay of Optimization and Machine Learning Research
The fields of machine learning and mathematical programming are increasingly intertwined. Optimization problems lie at the heart of most machine learning approaches. The Special T...
Kristin P. Bennett, Emilio Parrado-Hernánde...
NJC
2000
169views more  NJC 2000»
13 years 7 months ago
A Type System for Bounded Space and Functional In-Place Update
We show how linear typing can be used to obtain functional programs which modify heap-allocated data structures in place. We present this both as a "design pattern" for ...
Martin Hofmann