Tools
Tools
Smith, Barbara M. and Sturdy, Paula (2005) Value ordering for finding all solutions. In: IJCAI-05 Nineteenth International Joint Conference on Artificial Intelligence, 30th July-5th Aug 2005, Edinburgh, Scotland. (Unpublished)
Metadata only available from this repository.Abstract
In finding all solutions to a constraint satisfaction
problem, or proving that there are none, with a
search algorithm that backtracks chronologically
and forms k-way branches, the order in which the
values are assigned is immaterial. However, we
show that if the values of a variable are assigned
instead via a sequence of binary choice points, and
the removal of the value just tried from the domain
of the variable is propagated before another value
is selected, the value ordering can affect the search
effort. We show that this depends on the problem
constraints; for some types of constraints, we show
that the savings in search effort can be significant,
given a good value ordering
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Subjects: | T Technology > T Technology (General) Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
| Schools: | School of Computing and Engineering School of Computing and Engineering > Informatics Research Group School of Computing and Engineering > Informatics Research Group > Software Engineering Research Group |
| Related URLs: | |
| Depositing User: | Briony Heyhoe |
| Date Deposited: | 05 Aug 2008 16:45 |
| Last Modified: | 05 Jan 2011 12:29 |
| URI: | http://eprints.hud.ac.uk/id/eprint/1347 |
Item control for Repository Staff only:
| View Item |