International Conference on Electronics, Information and Communication Engineering (EICE 2012) 2012
DOI: 10.1115/1.859971.paper14
|View full text |Cite
|
Sign up to set email alerts
|

Using Control Network Programming in Teaching Randomization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2017
2017
2017
2017

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 3 publications
0
1
0
Order By: Relevance
“…In particular, that allows simple 'visual' implementation of o heuristic algorithms [4,5,28] o nondeterministic algorithms [29] o randomized algorithms [30] • The programmer can define the solution scope, that is, how many solutions will be found (if they exist) -a single solution, a fixed in advance number of solutions, all solutions, prompting after each solution if another solution should be sought. For example, the recognizer of arithmetic expressions (Fig.…”
Section: Full Cnp Vs Cinnamon Programmingmentioning
confidence: 99%
“…In particular, that allows simple 'visual' implementation of o heuristic algorithms [4,5,28] o nondeterministic algorithms [29] o randomized algorithms [30] • The programmer can define the solution scope, that is, how many solutions will be found (if they exist) -a single solution, a fixed in advance number of solutions, all solutions, prompting after each solution if another solution should be sought. For example, the recognizer of arithmetic expressions (Fig.…”
Section: Full Cnp Vs Cinnamon Programmingmentioning
confidence: 99%