More smear-based variable selection heuristics for ncsps

IGNACIO DANIEL ARAYA ZAMORANO, Victor Reyes, Cristián Oreallana

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations

Abstract

In this work we attempt to study and discover the principles behind one of the most succesfulvariable selection heuristics in branch-and-prune interval-based solvers: the Smear-based heuristics. Why these heuristics work Which is their objectiveCan we do any betterBased on the principles of the Smear functionand the well-known first-fail principle: 'To succeed, try first where you are most likely to fail' we propose several variable selection heuristics. The heuristics are tested and compared to the Smear-based oneson solving twenty nonlinear systems of equations. We report our first results and conclusions.

Original languageEnglish
Title of host publicationProceedings - 25th International Conference on Tools with Artificial Intelligence, ICTAI 2013
Pages1004-1011
Number of pages8
DOIs
StatePublished - 1 Dec 2013
Event25th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2013 - Washington, DC, United States
Duration: 4 Nov 20136 Nov 2013

Publication series

NameProceedings - International Conference on Tools with Artificial Intelligence, ICTAI
ISSN (Print)1082-3409

Conference

Conference25th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2013
Country/TerritoryUnited States
CityWashington, DC
Period4/11/136/11/13

Keywords

  • Fail-first
  • interval-based solvers
  • numerical CSP
  • variable selection

Fingerprint

Dive into the research topics of 'More smear-based variable selection heuristics for ncsps'. Together they form a unique fingerprint.

Cite this