Sciweavers

130 search results - page 11 / 26
» Vertical Benchmarks for CAD
Sort
View
EOR
2010
133views more  EOR 2010»
14 years 12 months ago
A memetic algorithm for graph coloring
Given an undirected graph G = (V, E) with a set V of vertices and a set E of edges, the graph coloring problem consists of partitioning all vertices into k independent sets and th...
Zhipeng Lü, Jin-Kao Hao
BMCBI
2007
115views more  BMCBI 2007»
14 years 12 months ago
How accurate and statistically robust are catalytic site predictions based on closeness centrality?
Background: We examine the accuracy of enzyme catalytic residue predictions from a network representation of protein structure. In this model, amino acid α-carbons specify vertic...
Eric Chea, Dennis R. Livesay
HEURISTICS
2006
120views more  HEURISTICS 2006»
14 years 11 months ago
A study of ACO capabilities for solving the maximum clique problem
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of ...
Christine Solnon, Serge Fenet
ICTAI
2007
IEEE
15 years 6 months ago
Hypergraph Partitioning for Exploiting Localities in Nonlinear Constrained Optimization
In this paper, we present a new hypergraph partitioning algorithm that jointly optimizes the number of hyperedge cuts and the number of shared vertices in nonlinear constrained op...
Benjamin W. Wah, Soomin Lee
PVLDB
2008
118views more  PVLDB 2008»
14 years 11 months ago
Column-store support for RDF data management: not all swans are white
This paper reports on the results of an independent evaluation of the techniques presented in the VLDB 2007 paper "Scalable Semantic Web Data Management Using Vertical Partit...
Lefteris Sidirourgos, Romulo Goncalves, Martin L. ...