1364 search results - page 37 / 273 » Collective Optimization |
IPPS
1997
IEEE
14 years 2 months ago
1997
IEEE
The k-merge problem, given a collection of k, (2 k n), sorted sequences of total length n, asks to merge them into a new sorted sequence. The main contribution of this work is...
SERP
2007
13 years 11 months ago
2007
Escape analysis can improve the speed and memory efficiency of garbage collected languages by allocating objects to the call stack, but an offline analysis will potentially interf...
AIIDE
2009
13 years 11 months ago
2009
We demonstrate an approach to modelling the effects of certain parameters of platform game levels on the players' experience of the game. A version of Super Mario Bros has be...
DAM
2006
13 years 10 months ago
2006
In this paper we consider a non-cooperative two-person zero-sum matrix game, called dice game. In an (n, ) dice game, two players can independently choose a dice from a collection...
VEE
2006
ACM
14 years 3 months ago
2006
ACM
Many new Java runtime optimizations report relatively small, single-digit performance improvements. On modern virtual and actual hardware, however, the performance impact of an op...