Sciweavers

1368 search results - page 274 / 274
» Avoiding Simplicity Is Complex
Sort
View
NIS
1998
131views more  NIS 1998»
13 years 5 months ago
Dynamic Memory Allocation for Large Query Execution
The execution time of a large query depends mainly on the memory utilization which should avoid disk accesses for intermediate results. Poor memory management can hurt performance ...
Luc Bouganim, Olga Kapitskaia, Patrick Valduriez
CP
2006
Springer
13 years 7 months ago
Distributed Stable Matching Problems with Ties and Incomplete Lists
We consider the Stable Marriage Problem and the Stable Roommates Problem in presence of ties and incomplete preference lists. They can be solved by centralized algorithms, but this...
Ismel Brito, Pedro Meseguer
BMCBI
2007
162views more  BMCBI 2007»
13 years 5 months ago
Genome-wide identification of specific oligonucleotides using artificial neural network and computational genomic analysis
Background: Genome-wide identification of specific oligonucleotides (oligos) is a computationallyintensive task and is a requirement for designing microarray probes, primers, and ...
Chun-Chi Liu, Chin-Chung Lin, Ker-Chau Li, Wen-Shy...