Back to Results
First PageMeta Content
Graph operations / Tree decomposition / Connectivity / Path decomposition / Decomposition method / Nondeterministic algorithm / Connected component / Tree / Graph theory / Theoretical computer science / Mathematics


Tackling the Partner Units Configuration Problem∗ Markus Aschinger, Conrad Drescher, Georg Gottlob, Peter Jeavons, Evgenij Thorstensen Computing Laboratory University of Oxford
Add to Reading List

Document Date: 2013-06-06 21:34:43


Open Document

File Size: 175,73 KB

Share Result on Facebook

Company

Siemens Austria / Finding Optimal Solutions First Next / McDermott / /

/

Event

Product Issues / Product Recall / /

Facility

Evgenij Thorstensen Computing Laboratory University of Oxford firstname.lastname@comlab.ox.ac.uk Abstract The Partner Units Problem / store U1 / /

IndustryTerm

non-deterministic algorithm / security applications / heuristic search / heuristic search methods / important applications / intelligent traffic management / cyclic solution / iterative deepening search / cyclic solutions / search tree / non-deterministic hypertree decomposition algorithm / search heuristics / transport systems / search mechanism / /

Organization

SP UP / V ( CR ) / SP UDP / Evgenij Thorstensen Computing Laboratory University of Oxford / /

Person

Conrad Drescher / T. Walsh / Evgenij Thorstensen / P. van Beek / Georg Gottlob / Peter Jeavons / /

Position

tackle / same pair hB / representative / /

Product

Optimal Solutions First Next / /

ProgrammingLanguage

C / /

PublishedMedium

Journal of the ACM / /

Technology

ECIDE SP UP algorithm / artificial intelligence / Java / PACE algorithm / backtracking-based algorithm / non-deterministic hypertree decomposition algorithm / UDP / non-deterministic algorithm / /

URL

www.mat.unical.it/aspcomp2011 / /

SocialTag