Back to Results
First PageMeta Content
Induced path / Graph / Matroid theory / Graph coloring / NP-complete problems / Pseudoforest / Graph theory / Graph operations / Path decomposition


Computing Science TACKLING THE PARTNER UNITS CONFIGURATION PROBLEM Markus Aschinger, Conrad Drescher, Gerhard Friedrich, Georg Gottlob, Peter Jeavons, Anna Ryabokon, Evgenij Thorstensen
Add to Reading List

Document Date: 2013-06-06 21:32:58

Open Document

File Size: 274,61 KB

Share Result on Facebook

Company

Computing Laboratory / Oxford University Computing Laboratory / /

/

Event

Force Majeure / Reorganization / /

Facility

University of Oxford / Alpen-Adria-Universit¨at Klagenfurt †† Computing Laboratory / Computing Laboratory / Wolfson Building / Evgenij Thorstensen CS-RR-10-28 Oxford University Computing Laboratory Wolfson Building / Oxford Man Institute of Quantitative Finance / /

IndustryTerm

cyclic solution / iterative deepening search / security applications / cyclic solutions / intelligent traffic management / /

Organization

Institut f¨ur Angewandte Informatik / SP UP / Oxford University / Alpen-Adria-Universit¨at Klagenfurt †† Computing Laboratory / SP UDP / at Klagenfurt †† Computing Laboratory / University of Oxford / Oxford Man Institute of Quantitative Finance / /

Person

Peter Jeavonsk / Conrad Drescher / Georg Gottlob / Anna Ryabokon / Peter Jeavons / Gerhard Friedrich / /

/

Position

Librarian / /

Technology

PACE algorithm / UDP / /

SocialTag