Sciweavers

15485 search results - page 282 / 3097
» Computing Optimal Subsets
Sort
View
CGF
2007
135views more  CGF 2007»
15 years 6 months ago
Variational 3D Shape Segmentation for Bounding Volume Computation
We propose a variational approach to computing an optimal segmentation of a 3D shape for computing a union of tight bounding volumes. Based on an affine invariant measure of e-ti...
Lin Lu, Yi-King Choi, Wenping Wang, Myung-Soo Kim
CLUSTER
2006
IEEE
16 years 21 days ago
Robust task scheduling in non-deterministic heterogeneous computing systems
The paper addresses the problem of matching and scheduling of DAG-structured application to both minimize the makespan and maximize the robustness in a heterogeneous computing sys...
Zhiao Shi, Emmanuel Jeannot, Jack Dongarra
ISPAN
1999
IEEE
15 years 11 months ago
A Java Internet Computing Environment with Effective Configuration Method
For an effective Internet-based distributed parallel computing platform, Java-Internet Computing Environment (JICE) is designed and implemented with multithreading and remote meth...
Chun-Mok Chung, Pil-Sup Shin, Shin-Dug Kim
TCS
2010
15 years 5 months ago
Computing the graph-based parallel complexity of gene assembly
We consider a graph-theoretical formalization of the process of gene assembly in ciliates introduced in Ehrenfeucht et al (2003), where a gene is modeled as a signed graph. The ge...
Artiom Alhazov, Chang Li, Ion Petre
GECCO
2006
Springer
167views Optimization» more  GECCO 2006»
15 years 10 months ago
Genomic computing networks learn complex POMDPs
A genomic computing network is a variant of a neural network for which a genome encodes all aspects, both structural and functional, of the network. The genome is evolved by a gen...
David J. Montana, Eric Van Wyk, Marshall Brinn, Jo...