Sciweavers

8196 search results - page 440 / 1640
» Computational Modeling and Complexity Science
Sort
View
PPOPP
2009
ACM
16 years 7 months ago
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
Seunghwa Kang, David A. Bader
EOR
2008
159views more  EOR 2008»
15 years 6 months ago
A survey on the continuous nonlinear resource allocation problem
Our problem of interest consists of minimizing a separable, convex and differentiable function over a convex set, defined by bounds on the variables and an explicit constraint des...
Michael Patriksson
JIB
2006
67views more  JIB 2006»
15 years 6 months ago
The implications for Bioinformatics of integration across physical scales
Bioinformatics blossomed with research developments in molecular biology. But as the focus of research moves back up the physical scale to the biology of whole multicellular organ...
T. Charles Hodgman, Y. Ugartechea-Chirino, G. Tans...
WWW
2008
ACM
16 years 7 months ago
Computing minimum cost diagnoses to repair populated DL-based ontologies
Ontology population is prone to cause inconsistency because the populating process is imprecise or the populated data may conflict with the original data. By assuming that the int...
Jianfeng Du, Yi-Dong Shen
SOFSEM
2010
Springer
16 years 1 months ago
On a Labeled Vehicle Routing Problem
In this paper, we study the complexity and (in)approximability of the minimum label vehicle routing problem. Given a simple complete graph G = (V, E) containing a special vertex 0 ...
Hatem Chatti, Laurent Gourvès, Jér&o...