Sciweavers

9842 search results - page 1612 / 1969
» Problem complexity
Sort
View
WDAG
2005
Springer
118views Algorithms» more  WDAG 2005»
16 years 8 days ago
Distributed Computing with Imperfect Randomness
Randomness is a critical resource in many computational scenarios, enabling solutions where deterministic ones are elusive or even provably impossible. However, the randomized solu...
Shafi Goldwasser, Madhu Sudan, Vinod Vaikuntanatha...
XPU
2005
Springer
16 years 8 days ago
An Approach for Assessing Suitability of Agile Solutions: A Case Study
Dynamic market situation and changing customer requirements generate more demands for the product development. Product releases should be developed and managed in short iterations ...
Minna Pikkarainen, Ulla Passoja
GECCO
2005
Springer
150views Optimization» more  GECCO 2005»
16 years 8 days ago
A GA for maximum likelihood phylogenetic inference using neighbour-joining as a genotype to phenotype mapping
Evolutionary relationships among species can be represented by a phylogenetic tree and inferred by optimising some measure of fitness, such as the statistical likelihood of the t...
Leon Poladian
ASPDAC
2004
ACM
120views Hardware» more  ASPDAC 2004»
16 years 7 days ago
Temporal floorplanning using 3D-subTCG
Improving logic capacity by time-sharing, dynamically reconfigurable FPGAs are employed to handle designs of high complexity and functionality. In this paper, we use a novel topo...
Ping-Hung Yuh, Chia-Lin Yang, Yao-Wen Chang, Hsin-...
CSCW
2004
ACM
16 years 7 days ago
The multiple views of inter-organizational authoring
Collaborative authoring is a common workplace task. Yet, despite improvements in word processors, communication software, and file sharing, many problems continue to plague co-aut...
David W. McDonald, Chunhua Weng, John H. Gennari
« Prev « First page 1612 / 1969 Last » Next »