Sciweavers

3913 search results - page 676 / 783
» complexity 2006
Sort
View
JSA
2000
115views more  JSA 2000»
14 years 9 months ago
Scheduling optimization through iterative refinement
Scheduling DAGs with communication times is the theoretical basis for achieving efficient parallelism on distributed memory systems. We generalize Graham's task-level in a ma...
Mayez A. Al-Mouhamed, Adel Al-Massarani
JUCS
2010
117views more  JUCS 2010»
14 years 8 months ago
NP-completeness and FPT Results for Rectilinear Covering Problems
Abstract: This paper discusses three rectilinear (that is, axis-parallel) covering problems in d dimensions and their variants. The first problem is the Rectilinear Line Cover whe...
Vladimir Estivill-Castro, Apichat Heednacram, Fran...
JACM
2006
99views more  JACM 2006»
14 years 10 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller
GPEM
2007
87views more  GPEM 2007»
14 years 10 months ago
Motility, mixing, and multicellularity
Abstract. A fundamental issue in evolutionary biology is the transition from unicellular to multicellular organisms, and the cellular differentiation that accompanies the increase...
Cristian A. Solari, John O. Kessler, Raymond E. Go...
OZCHI
2006
ACM
15 years 3 months ago
Beyond security: implications for the future of federated digital identity management systems
Federated identity management is often viewed by corporations as a solution to support secure online commerce by synthesising complex and fragmented user information into a single...
Christine Satchell, Graeme G. Shanks, Steve Howard...