6045 search results - page 1075 / 1209 » Computable Linearizations of Well-partial-orderings |
AI
2002
Springer
13 years 9 months ago
2002
Springer
This article surveys three techniques for enhancing heuristic game-tree search pioneered in the author's Othello program Logistello, which dominated the computer Othello scen...
RTSS
1999
IEEE
14 years 1 months ago
1999
IEEE
Reward-based scheduling refers to the problem in which there is a reward associated with the execution of a task. In our framework, each real-time task comprises a mandatory and a...
CVPR
1998
IEEE
14 years 1 months ago
1998
IEEE
Image mosaics are useful for a variety of tasks in vision and computer graphics. A particularly convenient way to generate mosaics is by `stitching' together many ordinary ph...
ICS
1999
Tsinghua U.
14 years 1 months ago
1999
Tsinghua U.
Programming languages that provide multidimensional arrays and a flat linear model of memory must implement a mapping between these two domains to order array elements in memory....
ICS
1999
Tsinghua U.
14 years 1 months ago
1999
Tsinghua U.
On modern computers, the performance of programs is often limited by memory latency rather than by processor cycle time. To reduce the impact of memory latency, the restructuring ...