Sciweavers

26354 search results - page 4973 / 5271
» How we refactor, and how we know it
Sort
View
PARCO
1997
15 years 8 months ago
Scheduling Block-Cyclic Array Redistribution
This article is devoted to the run-time redistribution of arrays that are distributed in a blockcyclic fashion over a multidimensional processor grid. While previous studies have ...
Frederic Desprez, Jack Dongarra, Antoine Petitet, ...
WSC
2000
15 years 8 months ago
Using simulation and critical points to define states in continuous search spaces
Many artificial intelligence techniques rely on the notion ate" as an abstraction of the actual state of the nd an "operator" as an abstraction of the actions that ...
Marc S. Atkin, Paul R. Cohen
SODA
1997
ACM
169views Algorithms» more  SODA 1997»
15 years 8 months ago
Partial Matching of Planar Polylines Under Similarity Transformations
Given two planar polylines T and P with n and m edges, respectively, we present an Om2 n2  time, Omn space algorithm to nd portions of the text" T which are similar in sh...
Scott D. Cohen, Leonidas J. Guibas
ACL
1994
15 years 8 months ago
A Markov Language Learning Model for Finite Parameter Spaces
This paper shows how to formally characterize language learning in a finite parameter space as a Markov structure, hnportant new language learning results follow directly: explici...
Partha Niyogi, Robert C. Berwick
177
Voted
CASCON
1996
134views Education» more  CASCON 1996»
15 years 8 months ago
Paradigm shift in software re-engineering: an experience report
Software re-engineering is one of the solutions advocated for the problems that are encountered during maintenance. The three major phases of a re-engineering process are (i) reve...
Kasilingam Periyasamy, C. Mathew
« Prev « First page 4973 / 5271 Last » Next »