Sciweavers

1184 search results - page 91 / 237
» Memory Design for Constrained Dynamic Optimization Problems
Sort
View
HPCA
1998
IEEE
15 years 6 months ago
PRISM: An Integrated Architecture for Scalable Shared Memory
This paper describes PRISM, a distributed sharedmemory architecture that relies on a tightly integrated hardware and operating system design for scalable and reliable performance....
Kattamuri Ekanadham, Beng-Hong Lim, Pratap Pattnai...
113
Voted
RECOMB
2002
Springer
16 years 2 months ago
String barcoding: uncovering optimal virus signatures
There are many critical situations when one needs to rapidly identify an unidentified pathogen from among a given set of previously sequenced pathogens. DNA or RNA hybridization c...
Sam Rash, Dan Gusfield
128
Voted
GECCO
2006
Springer
162views Optimization» more  GECCO 2006»
15 years 6 months ago
Indirect co-evolution for understanding belief in an incomplete information dynamic game
This study aims to design a new co-evolution algorithm, Mixture Co-evolution which enables modeling of integration and composition of direct co-evolution and indirect coevolution....
Nanlin Jin
162
Voted
VLDB
2002
ACM
143views Database» more  VLDB 2002»
15 years 2 months ago
SQL Memory Management in Oracle9i
Complex database queries require the use of memory-intensive operators like sort and hashjoin. Those operators need memory, also referred to as SQL memory, to process their input ...
Benoît Dageville, Mohamed Zaït
PODS
2009
ACM
119views Database» more  PODS 2009»
16 years 3 months ago
Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes
The B-tree is a fundamental external index structure that is widely used for answering one-dimensional range reporting queries. Given a set of N keys, a range query can be answere...
Ke Yi