Sciweavers

11129 search results - page 347 / 2226
» Modeling Search Computing Applications
Sort
View
AI
2002
Springer
15 years 6 months ago
Improving heuristic mini-max search by supervised learning
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...
Michael Buro
PDPTA
2003
15 years 8 months ago
HPJava: Programming Support for High-Performance Grid-Enabled Applications
The paper begins by considering what a Grid Computing Environment might be, why it is demanded, and how the authors’ HPspmd programming fits into this picture. We then review o...
Han-Ku Lee, Bryan Carpenter, Geoffrey Fox, Sang Bo...
ICMCS
2007
IEEE
107views Multimedia» more  ICMCS 2007»
16 years 1 months ago
Power Efficient Motion Estimation using Multiple Imprecise Metric Computations
In this paper, we propose power efficient motion estimation (ME) using multiple imprecise sum absolute difference (SAD) metric computations. We extend recent work in [18] by prov...
In Suk Chong, Antonio Ortega
AUTOMATICA
2008
139views more  AUTOMATICA 2008»
15 years 6 months ago
Structured low-rank approximation and its applications
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
Ivan Markovsky

Publication
179views
17 years 5 months ago
Characteristics of Destination Address Locality in Computer Networks: A Comparison of Caching Schemes
The size of computer networks, along with their bandwidths, is growing exponentially. To support these large, high-speed networks, it is neccessary to be able to forward packets in...
R. Jain