About: Limited Assignments: A New Cutoff Strategy for Incomplete Depth-First Search

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Limited Assignments: A New Cutoff Strategy for Incomplete Depth-First Search Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	In this paper, we propose an extension of three incomplete depth-first search techniques, namely depth-bounded backtrack search, credit search, and iterative broadening, towards producing incomplete solutions. We also propose a new cutoff strategy for incomplete depth-first search motivated by a human style of problem solving. This technique, called limited assignment number (LAN) search, is based on limiting the number of attempts tried to assign a value to the variable. A linear worstcase time complexity of LAN Search leads to promising stable time behavior in all accomplished experiments. The techniques are studied in the context of constraint satisfaction problems. In this paper, we propose an extension of three incomplete depth-first search techniques, namely depth-bounded backtrack search, credit search, and iterative broadening, towards producing incomplete solutions. We also propose a new cutoff strategy for incomplete depth-first search motivated by a human style of problem solving. This technique, called limited assignment number (LAN) search, is based on limiting the number of attempts tried to assign a value to the variable. A linear worstcase time complexity of LAN Search leads to promising stable time behavior in all accomplished experiments. The techniques are studied in the context of constraint satisfaction problems. (en)
Title	Limited Assignments: A New Cutoff Strategy for Incomplete Depth-First Search Limited Assignments: A New Cutoff Strategy for Incomplete Depth-First Search (en)
skos:prefLabel	Limited Assignments: A New Cutoff Strategy for Incomplete Depth-First Search Limited Assignments: A New Cutoff Strategy for Incomplete Depth-First Search (en)
skos:notation	RIV/00216224:14330/05:00014801!RIV10-MSM-14330___
http://linked.open...avai/riv/aktivita	P Z
http://linked.open...avai/riv/aktivity	P(1M0545), P(GA201/04/1102), Z(MSM0021620838), Z(MSM0021622419)
http://linked.open...vai/riv/dodaniDat	2010
http://linked.open...aciTvurceVysledku	Rudová, Hana
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Masarykova univerzita / Fakulta informatiky
http://linked.open...dnocenehoVysledku	528171
http://linked.open...ai/riv/idVysledku	RIV/00216224:14330/05:00014801
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	search; constraint programming (en)
http://linked.open.../riv/klicoveSlovo	search constraint programming
http://linked.open...ontrolniKodProRIV	[18AEFA3EB396]
http://linked.open...v/mistoKonaniAkce	New York, NY, USA
http://linked.open...i/riv/mistoVydani	New York, NY, USA
http://linked.open...i/riv/nazevZdroje	Proceedings of the 2005 ACM symposium on Applied computing
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...vavai/riv/projekt	Institute for Theoretical Computer Science Constraint-based planning and scheduling
http://linked.open...UplatneniVysledku	2005
http://linked.open...iv/tvurceVysledku	Barták, Roman Rudová, Hana
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2005-01-01 (xsd:date)
http://linked.open...n/vavai/riv/zamer	Moderní metody, struktury a systémy informatiky Highly Parallel and Distributed Computing Systems
number of pages	5 (xsd:int)
http://purl.org/ne...btex#hasPublisher	ACM Press
https://schema.org/isbn	1-58113-964-0
http://localhost/t...ganizacniJednotka	14330

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software