Sciweavers

4066 search results - page 290 / 814
» Almost Complete Sets
Sort
View
COR
2010
164views more  COR 2010»
15 years 6 months ago
The distributed permutation flowshop scheduling problem
This paper studies a new generalization of the regular permutation flowshop scheduling problem (PFSP) referred to as the distributed permutation flowshop scheduling problem or DPF...
B. Naderi, Rubén Ruiz
ALGORITHMICA
2006
163views more  ALGORITHMICA 2006»
15 years 6 months ago
Building Large Phylogenetic Trees on Coarse-Grained Parallel Machines
Phylogenetic analysis is an area of computational biology concerned with the reconstruction of evolutionary relationships between organisms, genes, and gene families. Maximum likel...
Thomas M. Keane, Andrew J. Page, Thomas J. Naughto...
MST
2006
99views more  MST 2006»
15 years 6 months ago
Complexity of the Exact Domatic Number Problem and of the Exact Conveyor Flow Shop Problem
We prove that the exact versions of the domatic number problem are complete for the levels of the boolean hierarchy over NP. The domatic number problem, which arises in the area of...
Tobias Riege, Jörg Rothe
AI
2004
Springer
15 years 6 months ago
On the computational complexity of qualitative coalitional games
We study coalitional games in which agents are each assumed to have a goal to be achieved, and where the characteristic property of a coalition is a set of choices, with each choi...
Michael Wooldridge, Paul E. Dunne
CMPB
2004
132views more  CMPB 2004»
15 years 6 months ago
Design and implementation of software for assembly and browsing of 3D brain atlases
: Visualization software for three dimensional digital brain atlases present many challenges in design and implementation. These challenges include the design of an effective human...
Carl Gustafson, Oleh J. Tretiak, Louise Bertrand, ...