Sciweavers

446 search results - page 39 / 90
» A new paradigm for programming competitions
Sort
View
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
14 years 28 days ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Gene Myers
EXPCS
2007
14 years 17 days ago
Introducing entropies for representing program behavior and branch predictor performance
Predictors are inherent components of state-of-the-art microprocessors. Branch predictors are discussed actively from diverse perspectives. Performance of a branch predictor large...
Takashi Yokota, Kanemitsu Ootsu, Takanobu Baba
AIM
1998
13 years 8 months ago
Computer Bridge - A Big Win for AI Planning
A computer program that uses AI planning techniques is now the world’s best program for the game of contract bridge. As reported in The New York Times and The Washington Post, t...
Stephen J. J. Smith, Dana S. Nau, Thomas A. Throop
AMAI
2008
Springer
13 years 8 months ago
Set based logic programming
In a previous paper [BMR01], the authors showed that the mechanism underlying Logic Programming can be extended to handle the situation where the atoms are interpreted as subsets o...
Howard A. Blair, Victor W. Marek, Jeffrey B. Remme...
IJHPCA
2007
114views more  IJHPCA 2007»
13 years 8 months ago
An Approach To Data Distributions in Chapel
A key characteristic of today’s high performance computing systems is a physically distributed memory, which makes the efficient management of locality essential for taking adv...
R. E. Diaconescu, Hans P. Zima