Searching for "Choices Without Backtracking." – sorted by Relevance.
-
Constraint and Integer Programming in OPL
- problem is thus found with two choices and without backtracking, i.e., without reconsidering any
- Cited by 13 (4 self) – Add To MetaCart
-
Greedy regular expression matching
- these choices without backtracking, a first preprocessing pass annotates the word with enough information
- Cited by 11 (0 self) – Add To MetaCart

