5831 search results - page 600 / 1167 » Distributed Dynamic Backtracking |
188
click to vote
IPPS
2002
IEEE
15 years 11 months ago
2002
IEEE
Query scheduling plays an important role when systems are faced with limited resources and high workloads. It becomes even more relevant for servers applying multiple query optimi...
165
click to vote
SPAA
2010
ACM
15 years 11 months ago
2010
ACM
When a program uses Software Transactional Memory (STM) to synchronize accesses to shared memory, the performance often depends on which STM implementation is used. Implementation...
198
click to vote
ICCBR
2001
Springer
15 years 11 months ago
2001
Springer
For dynamic sales dialogs in electronic commerce scenarios, approaches based on an information gain measure used for attribute selection have been suggested. These measures conside...
181
click to vote
IPPS
2000
IEEE
15 years 11 months ago
2000
IEEE
Dynamic replication algorithms aim at allocating, migrating and deleting copies of an object over various Internet hosts, according to the access patterns exhibited online, so as ...
199
click to vote
PPOPP
1999
ACM
15 years 11 months ago
1999
ACM
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...