Sciweavers

1972 search results - page 150 / 395
» Evolutionary algorithms and dynamic programming
Sort
View
ICPR
2006
IEEE
14 years 10 months ago
An Efficient Radical-Based Algorithm for Stroke-Order-Free Online Kanji Character Recognition
This paper investigates improvements of an online handwriting stroke-order analysis algorithm -- cube search, based on cube graph stroke-order generation model and dynamic program...
Hiroaki Sakoe, Seiichi Uchida, Wenjie Cai
VISSOFT
2002
IEEE
14 years 2 months ago
Specifying Algorithm Visualizations in Terms of Data Flow
Interesting events and state mapping are two approaches used to specify software visualization. They are applied in, respectively, event-driven and data-driven visualization syste...
Jaroslaw Francik
CATA
2006
13 years 11 months ago
A Load Balancing Technique for Some Coarse-Grained Multicomputer Algorithms
The paper presents a load balancing method for some CGM (Coarse-Grained Multicomputer) algorithms. This method can be applied on different dynamic programming problems such as: Lo...
Thierry Garcia, David Semé
CASES
2010
ACM
13 years 7 months ago
Fine-grain dynamic instruction placement for L0 scratch-pad memory
We present a fine-grain dynamic instruction placement algorithm for small L0 scratch-pad memories (spms), whose unit of transfer can be an individual instruction. Our algorithm ca...
JongSoo Park, James D. Balfour, William J. Dally
SPIN
2005
Springer
14 years 3 months ago
Symbolic Model Checking for Asynchronous Boolean Programs
Abstract. Software model checking problems generally contain two different types of non-determinism: 1) non-deterministically chosen values; 2) the choice of interleaving among th...
Byron Cook, Daniel Kroening, Natasha Sharygina