Sciweavers

3113 search results - page 177 / 623
» Efficiently Generating Efficient Generating Extensions in Pr...
Sort
View
AAAI
1998
15 years 5 months ago
Branch and Bound Algorithm Selection by Performance Prediction
Wepropose a method called Selection by Performance Prediction (SPP) which allows one, when faced with a particular problem instance, to select a Branch and Boundalgorithm from amo...
Lionel Lobjois, Michel Lemaître
AE
2009
Springer
15 years 5 months ago
Memetic Algorithms for Constructing Binary Covering Arrays of Strength Three
Abstract. This paper presents a new Memetic Algorithm (MA) designed to compute near-optimal solutions for the covering array construction problem. It incorporates several distingui...
Eduardo Rodriguez-Tello, Jose Torres-Jimenez
TSP
2008
139views more  TSP 2008»
15 years 4 months ago
Bayesian Filtering With Random Finite Set Observations
This paper presents a novel and mathematically rigorous Bayes recursion for tracking a target that generates multiple measurements with state dependent sensor field of view and clu...
Ba-Tuong Vo, Ba-Ngu Vo, Antonio Cantoni
BMCBI
2011
14 years 7 months ago
Robust joint analysis allowing for model uncertainty in two-stage genetic association studies
Background: The cost efficient two-stage design is often used in genome-wide association studies (GWASs) in searching for genetic loci underlying the susceptibility for complex di...
Dongdong Pan, Qizhai Li, Ningning Jiang, Aiyi Liu,...
TVLSI
2008
140views more  TVLSI 2008»
15 years 4 months ago
A Novel Mutation-Based Validation Paradigm for High-Level Hardware Descriptions
We present a Mutation-based Validation Paradigm (MVP) technology that can handle complete high-level microprocessor implementations and is based on explicit design error modeling, ...
Jorge Campos, Hussain Al-Asaad