Sciweavers

62 search results - page 2 / 13
» The Fringe-Saving A* Search Algorithm - A Feasibility Study
Sort
View
CEC
2008
IEEE
13 years 11 months ago
Differential evolution for discrete optimization: An experimental study on Combinatorial Auction problems
: Differential evolutionary (DE) mutates solution vectors by the weighted difference of other vectors using arithmetic operations. As these operations cannot be directly extended t...
Jingqiao Zhang, Viswanath Avasarala, Arthur C. San...
INFOCOM
2005
IEEE
13 years 10 months ago
Hybrid search schemes for unstructured peer-to-peer networks
— We study hybrid search schemes for unstructured peer-to-peer networks. We quantify performance in terms of number of hits, network overhead, and response time. Our schemes comb...
Christos Gkantsidis, Milena Mihail, Amin Saberi
BMCBI
2007
97views more  BMCBI 2007»
13 years 5 months ago
SIRAC: Supervised Identification of Regions of Aberration in aCGH datasets
Background: Array comparative genome hybridization (aCGH) provides information about genomic aberrations. Alterations in the DNA copy number may cause the cell to malfunction, lea...
Carmen Lai, Hugo M. Horlings, Marc J. van de Vijve...
QSHINE
2005
IEEE
13 years 10 months ago
Solving The Multi-Constrained Path Selection Problem By Using Depth First Search
An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the n...
Zhenjiang Li, J. J. Garcia-Luna-Aceves
JMLR
2010
113views more  JMLR 2010»
12 years 11 months ago
Optimal Search on Clustered Structural Constraint for Learning Bayesian Network Structure
We study the problem of learning an optimal Bayesian network in a constrained search space; skeletons are compelled to be subgraphs of a given undirected graph called the super-st...
Kaname Kojima, Eric Perrier, Seiya Imoto, Satoru M...