Sciweavers

273 search results - page 48 / 55
» Improving the Efficiency of Memory Partitioning by Address C...
Sort
View
CN
2006
100views more  CN 2006»
14 years 9 months ago
Small-world overlay P2P networks: Construction, management and handling of dynamic flash crowds
We consider how to construct and maintain a structured overlay P2P network based on the small-world paradigm. Two main attractive properties of a small-world network are (1) a low...
Ken Y. K. Hui, John C. S. Lui, David K. Y. Yau
ICDE
2010
IEEE
244views Database» more  ICDE 2010»
15 years 9 months ago
Reliable Storage and Querying for Collaborative Data Sharing Systems
The sciences, business confederations, and medicine urgently need infrastructure for sharing data and updates among collaborators' constantly changing, heterogeneous databases...
Nicholas E. Taylor, Zachary G. Ives
HEURISTICS
2008
136views more  HEURISTICS 2008»
14 years 8 months ago
Enhancing set constraint solvers with lexicographic bounds
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
Andrew Sadler, Carmen Gervet
SIGARCH
2008
73views more  SIGARCH 2008»
14 years 9 months ago
Servo: a programming model for many-core computing
Conventional programming models were designed to be used by expert programmers for programming for largescale multiprocessors, distributed computational clusters, or specialized p...
Nicolas Zea, John Sartori, Rakesh Kumar
ASPLOS
2009
ACM
15 years 10 months ago
Dynamic prediction of collection yield for managed runtimes
The growth in complexity of modern systems makes it increasingly difficult to extract high-performance. The software stacks for such systems typically consist of multiple layers a...
Michal Wegiel, Chandra Krintz