Visual search tree profiling

DOI10.1007/S10601-015-9202-1zbMATH Open1334.90170OpenAlexW1155831713MaRDI QIDQ265707FDOQ265707

Authors: Maxim Shishmarev, Christopher Mears, Guido Tack, Maria Garcia De La Banda 

Publication date: 12 April 2016

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-015-9202-1

Recommendations

• scientific article; zbMATH DE number 1406253
• Fast searching in trees
• Recognizing graph search trees
• Searching Trees with Sources and Targets
• The profile of binary search trees
• Find-and-fetch search on a tree

zbMATH Keywords

comparisonconstraint programmingprofilingsearch treevisualisation

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cites Work

• Theory and Applications of Satisfiability Testing
• \textsf{SATGraf}: visualizing the evolution of SAT formula structure in solvers
• Model-driven visualizations of constraint-based local search
• Title not available (Why is that?)
• Title not available (Why is that?)
• Removing propagation redundant constraints in redundant modeling
• Understanding the Potential of Propagators

Cited In (8)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Deep Start: a hybrid strategy for automated performance problem searches
• How efficient is a global constraint in practice? A fair experimental framework
• Title not available (Why is that?)
• Model-driven visualizations of constraint-based local search
• Title not available (Why is that?)
• Title not available (Why is that?)

Uses Software

• DPvis
• COMET
• Choco
• Gecode
• VIFID/TRIFID
• ZeroMQ
• MinisatID
• SATGraf
• Oz Explorer
• CHUFFED
• DiSCiPl

This page was built for publication: Visual search tree profiling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q265707)