1380 search results - page 265 / 276 » Computing the optimal strategy to commit to |
CP
2001
Springer
14 years 25 days ago
2001
Springer
Abstract. This paper contains an experimental study of the impact of the construction strategy of reduced, ordered binary decision diagrams (ROBDDs) on the average-case computation...
ICS
1998
Tsinghua U.
14 years 16 days ago
1998
Tsinghua U.
In this paper we propose and evaluate the Adaptive++ technique, a novel runtime-only data prefetching strategy for software-based distributed shared-memory systems (software DSMs)...
IPPS
1997
IEEE
14 years 16 days ago
1997
IEEE
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...
COCO
1994
Springer
14 years 13 days ago
1994
Springer
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
EENERGY
2010
14 years 7 days ago
2010
As energy-related costs have become a major economical factor for IT infrastructures and data-centers, companies and the research community are being challenged to find better an...