Sciweavers

113 search results - page 14 / 23
» Combinatorial Flag Varieties
Sort
View
IWOCA
2009
Springer
149views Algorithms» more  IWOCA 2009»
14 years 1 months ago
Randomized Postoptimization of Covering Arrays
The construction of covering arrays with the fewest rows remains a challenging problem. Most computational and recursive constructions result in extensive repetition of coverage. W...
Peyman Nayeri, Charles J. Colbourn, Goran Konjevod
PRIB
2009
Springer
209views Bioinformatics» more  PRIB 2009»
14 years 1 months ago
Class Prediction from Disparate Biological Data Sources Using an Iterative Multi-Kernel Algorithm
For many biomedical modelling tasks a number of different types of data may influence predictions made by the model. An established approach to pursuing supervised learning with ...
Yiming Ying, Colin Campbell, Theodoros Damoulas, M...
AUSDM
2007
Springer
113views Data Mining» more  AUSDM 2007»
14 years 1 months ago
PCITMiner- Prefix-based Closed Induced Tree Miner for finding closed induced frequent subtrees
Frequent subtree mining has attracted a great deal of interest among the researchers due to its application in a wide variety of domains. Some of the domains include bio informati...
Sangeetha Kutty, Richi Nayak, Yuefeng Li
CP
2007
Springer
14 years 1 months ago
An Integrated White+Black Box Approach for Designing and Tuning Stochastic Local Search
Abstract. Stochastic Local Search (SLS) is a simple and effective paradigm for attacking a variety of Combinatorial (Optimization) Problems (COP). However, it is often non-trivial...
Steven Halim, Roland H. C. Yap, Hoong Chuin Lau
CPAIOR
2007
Springer
14 years 1 months ago
Best-First AND/OR Search for 0/1 Integer Programming
Abstract. AND/OR search spaces are a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensitivity to the struc...
Radu Marinescu 0002, Rina Dechter