Proceedings of the 13th International Conference on Computer Systems and Technologies 2012
DOI: 10.1145/2383276.2383333
|View full text |Cite
|
Sign up to set email alerts
|

Using control network programming in teaching nondeterminism

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2012
2012
2022
2022

Publication Types

Select...
2
1
1

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 7 publications
0
2
0
Order By: Relevance
“…• User has very powerful control tools -control states and system options -in order to direct and control the CN traversal [24,25]. 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%
“…• User has very powerful control tools -control states and system options -in order to direct and control the CN traversal [24,25]. 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%
“…• User has very powerful control tools -control states and system options -in order to direct and control the CN traversal [24,25]. In particular, that allows simple 'visual' implementation of o heuristic algorithms [2,3,26] o nondeterministic algorithms [27] o randomized algorithms [28] • 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%