Sciweavers

895 search results - page 86 / 179
» An Indirect Genetic Algorithm for Set Covering Problems
Sort
View
WG
2004
Springer
15 years 4 months ago
The Computational Complexity of the Minimum Weight Processor Assignment Problem
In portable multimedia systems a number of communicating tasks has to be performed on a set of heterogeneous processors. This should be done in an energy-efficient way. We give th...
Hajo Broersma, Daniël Paulusma, Gerard J. M. ...
CGI
2001
IEEE
15 years 2 months ago
A Hybrid Approach to the Recovery of Deformable Superquadric Models from 3D Data
The problem of recovering the shape of objects from three-dimensional data is important to many areas of computer graphics and vision. We present here a method for the recovery of...
James Sinnott, Toby Howard
COMCOM
2007
84views more  COMCOM 2007»
14 years 11 months ago
A genetic approach for adding QoS to distributed virtual environments
Distributed Virtual Environment (DVE) systems have been designed last years as a set of distributed servers. These systems allow a large number of remote users to share a single 3...
Silvia Rueda, Pedro Morillo, Juan M. Orduña...
TCBB
2011
14 years 6 months ago
Accurate Construction of Consensus Genetic Maps via Integer Linear Programming
—We study the problem of merging genetic maps, when the individual genetic maps are given as directed acyclic graphs. The computational problem is to build a consensus map, which...
Yonghui Wu, Timothy J. Close, Stefano Lonardi
AI
2000
Springer
14 years 11 months ago
A Lagrangian reconstruction of GENET
GENET is a heuristic repair algorithm which demonstrates impressive e ciency in solving some large-scale and hard instances of constraint satisfaction problems (CSPs). In this pap...
Kenneth M. F. Choi, Jimmy Ho-Man Lee, Peter J. Stu...