Forums de ToulBar2

Voir les forums

Mes forums surveillés
Forum Description Fils de discussion Messages Dernier message Niveau de modération
 open-discussion General Discussion 5 11 25/08/2016 11:07 Pas de modération
 help Get Public Help 2 2 13/10/2009 03:58 Pas de modération
 developers Project Developer Discussion 1 1 15/11/2005 11:32 Pas de modération
 toulbar2-is-one-of-the-winning-solvers-in-the-uai-challenge Toulbar2 is one of the winning solvers in the UAI 2010 Approximate Inference Challenge. See: http://www.cs.huji.ac.il/project/UAI10/ 0 0 01/01/1970 01:00 Pas de modération
 toulbar2-0.9.5 Toulbar2 0.9.5 is now available : - * Features : - *********** - refactoring of code allowing to add global decomposable cost function, including new constraint : weighteid among , weighted sum global constraint - new option -nopre to desactivate all preprocessing options - sort domains based on unary costs *** works only for binary wcsp problem files *** - avoid too many messages especially new solutions by using a negative verbosity level - avoid to many messages especially in BTD-like methods using negative verbosity - specific code for QTLmap (check treewidth value and abort if too high) - allows variable elimination during search for probabilistic inference (option -logz) - simple upper bounding (remove subtree if less than 0.001 improvement) scheme for probabilistic inference (option -logz) - benchmarking : new perl and cmake script for benchmarking management - option -t=[integer] - when giving a solution file as input (*.sol) with additional option -x then the search starts with an initial upper bound given by the solution and value heuristic tries solution values first. - branch and bound with restart at each solution (option -L=0). - new cost function wregular - detect and exploit ternary functional constraints - new option -static for using a static variable ordering heuristic (the same as used by DAC) - problem format .qpbo for quadratic pseudo-Boolean optimization (unconstrained quadratic programming) with variable domain {0,1} or {1,-1} and minimization/maximization. - new problem format .qpbo for quadratic pseudo-Boolean optimization (unconstrained quadratic programming) - sigma-gcc added in order to give different cost penalities proportional to (upper or lower) bounds violation. - hidden feature for CSP counting with DFBB and restricted search depth - documentation addons - ************************ - wregular , wsum , wamoung woverlap description - documentation corrections - avoid too many messages especially new solutions by using a negative verbosity level - problem format .qpbo for quadratic pseudo-Boolean optimization (unconstrained quadratic programming) with variable domain {0,1} or {1,-1} and minimization/maximization. - add qpbo example in validation/default/ 0 0 01/01/1970 01:00 Pas de modération
 toulbar2---0.9.6.0-release Toulbar2 release 0.9.6.0 including Dead end elimintion (DEE ) and various bugs fix an features 0 0 01/01/1970 01:00 Pas de modération
 new-toulbar2-release-0.9.7.0---available- DAG Based New global constraints (sgrammar,smax,samong) . ub improvement by local search (incop) and graph decompositon (peo) [bug] change memcpy into memmove avoiding source and destination overlap errors during command line parsing [bug] correct a bug in functional ternary constraints [bug] correct a bug on initial domain sizes when dumping a UAI-format problem with evidence into a WCSP-format file in original mode (-z=1) [bug] dead-end elimination is not performed before all the problem is loaded including unary cost functions (add DEE_ flag). [bug] divide initial maximum representable cost by a constant to try to avoid arithmetic overflows when dealing with costs [bug] EAC1 queue was not properly modified in propagateEAC [bug] incop correction : Timer remove under windows OS (not supported by mingw cross compiler) [bug] in order to avoid integer overflow when summing costs, shrinks forbidden costs in every cost function based on the difference of worst-case problem assignment total finite cost plus one minus problem global lower bound [bugs] bug correction in shortest path with negative costs [bugs] cpack architecture option has been update for rpm generation [bugs] incop is now available under windows and Linux version. Timer is not available under windows OS [bug] SIZE_MAX compile error debugging for some linux distribution [bug] wrong type for string constant when using flag for UAI Evaluation [code] 3 runs of local search by default. [code] add optimality gap information [code] bound hard costs to current optimality gap (upper bound-lower bound) for INCOP and catch contradiction if hard constraints are violated by INCOP best solution [code] changing DAC order (setDACOrder method) automatically [code] cleanup header dependencies and remove DOS/non ASCII chars [code] command line interface update : Version 3.6, fix for Issue 2: invalid clumped option isn t returned in OptionText [code] compatibility with Mac compiler [code] DEE performed before VAC in order to speed up VAC (should be no difference in lower bound) [code] disallow INCOP if there are large arity (>ToulBar2::preprocessNary) cost functions [code] disallow INCOP if there are non enumerated variable domains (defined by their bounds only) [code] force static cast on elimVarOrder global option [code] for compatibility with numberjack i(how to find include files) [code] global cost functions based on linear programming are untested, should not be used for the moment [code] global procedure to initialize ToulBar2 global variables, needed by numberjack/toulbar2 (tb2init) [code] header message for contribution to variable elimination ordering heuristics by Cyril Terrioux [code] improve efficiency of getTrueDegree (faster preprocessing) [code] improve initial upper bound for input problem in UAI format [code] INCOP local search and peo solvers affiliations updated [code] INCOP local search solver affiliation updated [code] INCOP local search solver by Bertrand Neveu integrated inside toulbar2 [code] INCOP local Search solver is now include in toulbar2 solver [code] INCOP will skip large arity (>ToulBar2::preprocessNary) cost functions or global cost functions (INCOP will solve a simplified problem) [code] LONGLONG_INDEX (tb2store.hpp) allows trailing stack indexes to be represented by long long int (only valid for 64-bit systems) in order to exploit very large memory computers [code] modification of simpleopt SO_MAX_ARGS and toulbar2 release tag include in the toulbar2 binary [code] moves template definitions from cpp to header files (also for tb2binconstr.hpp) [code] new tree decomposition heuristics only with BOOST compile flag ON [code] new version 0.9.7 doc [code] output number of "fixed" variables (having only one zero-cost value) after doing VAC [code] release number changed from 0.9.6 to 0.9.7 [code] remove an assert which may be not always valid [code] remove unused C++ variable [code] rename incop files using cpp extension [code] rename toulbar2.hpp into toulbar2lib.hpp for compatibility with numberjack and add comments to know specific code to change for numberjack [code] trailing stack indexes representation allows to exploit very large memory computers on 64-bit systems [code] tree decomposition greedy heuristics (from C. Terrioux's peo code) included in toulbar2 -O=[negative integer] : build a tree decomposition (if BTD-like and/or variable elimination methods are used) and also a compatible DAC ordering using (-1) maximum cardinality search ordering, (-2) minimum degree ordering, (-3) minimum fill-in ordering, (-4) maximum spanning tree ordering [code] unused incop files [code] update copyright year to 2014 [code] update current problem upper bound with the worst-case assignment finite cost after preprocessing and before INCOP [code] update initial upper bound to worst-case finite cost plus one [doc] updates documentation on global cost functions [doc] wcsp file format toulbar2/doc/wcspformat.txt documentation (extracted from doxygen) [doc] wcsp file format updated [feature] in preprocessing, iterates DAC-based propagation with current DAC order and its reverse until a fix point is reached or lower bound increased is too small (less than 0.5%) [feature] in preprocessing, iterates ternary cost function completion (option -t) until a fix point is reached or lower bound increased is too small (less than 0.5%) [feature] new flag ToulBar2::uaieval in order to output solution in UAI format even if input file is in WCSP format, allowing to presolve using INCOP local search. [feature] option -l=[integer] : limited discrepancy search, use a negative value to stop the search after the given absolute number of discrepancies has been explored [misc] new scripts for debugging runall.sh [misc] problem_original .wcsp name has been replaced by problem.wcsp [misc] solution checking for global contraint test case [misc] too longer cover test have been removed [option] new dynamic programming based global cost functions by CUHK [option] PLPS global cost function requires CPLEX [option] --save=filename : dump current wcsp into filename (see also option -z to select dump after preprocessing) [option] two new options: -timer=[integer] : CPU timout in seconds ; and -w=[filename] : writes last solution found in filename (or "sol" if no parameter is given) [option] reader of UAI format with logarithms instead of probabilities (.LG extension) 0 0 01/01/1970 01:00 Pas de modération
 toulbar2-new-release---0.9.8.0-available- [option] show debug information without line return if stdout is not a terminal, save open node size with bounds (see misc/scripts/bounds.sh) [option] -z=[filename] saves problem into filename (problem.wcsp if the parameter is missing), cn be used in conjunction with -z=[integer]. Notice that for mendelsoft, --save=[filename] should be used instead [option] use -hbfs by default [option] show exact optimality gap during hybrid best-first search [option] -open=[integer] fix a limit on the number of open search nodes in HBFS [option] new problem generator with global cost function salldiff [option] new debugging option -opt (checks a given optimal solution, given as extra solution file, is never pruned by propagation, works only if compiled in debug mode) and new option -bfs=[integer] to perform hybrid best-first search instead of usual depth-first search [option] change option -h into -n for preproject large-arity tables in preprocessing [option] -bfs has automatic parameter tuning and extra -gap threshold parameter [misc] Updated control file consistent with debian-science policy. [misc] should compile with old boost releases (&lt 1.56) [misc] script files to extract lower and upper bounds during search with time [misc] script files modified in order to take into account the new internal tree decomposition methods [misc] removed references to peo and narycsp. [misc] Removed old 32bits intel executable whose source has been swallowed in tb2 [misc] remove compilation warnings + Indentation using astyle. [misc] print global lower and upper bound gap information for any search method (except BTD-RDS) [misc] Nicer type names with boost [misc] New macro DEBUGONLY that removes code when NDEBUG is defined. [misc] new debugging option in g++ to check memory missing initialization [misc] Git based package version naming [misc] final excision of peo and narycsp/incop binary files [misc] avoid recompiling tb2wcsp each time. [misc] allows tb2trace.sh to be called outside its own directory [misc] add comment First version of git-version numbering: branch, hash, modified [errro] still a potential stochastic behavior on set of Clusters, cannot use getId to kill this bug.. [error] validation tests for global cost functions and debugging [error] VAC threshold descent must be initialized before any propagation (histogram automatically called before propagate) [error] VAC threshold descent must be initialized before any propagation (histogram automatically called before propagate) [error] unary cost partition for EAC may hide cost moves followed by value removals breaking EAC property - continued [error] unary cost partition for EAC may hide cost moves followed by value removals breaking EAC property [error] Throw contradiction if all probabilities of some CPT are zero in UAI format [error] still a potential stochastic behavior on set of Clusters, cannot use getId to kill this bug.. [error] Output correct log10likelihood for UAI/haplotypes [error] missing enforceub in restoring open nodes and add a hard limit on number of nodes before aborting current subproblem [error] minor corrections on cluster solution cost and optimal solution verification [error] global cost functions with arity less than 3 can be expressed and are automatically transformed into their equivalent function in extension before the search [error] forbids counting solutions using BTD in optimization [error] fix the issue on carseqflow_9_3.wcsp [error] Fix the issue of soft_regular does not go to the same fix-point for different implementation [error] Fix the issue of inconsistency between flow and DP for Regular() due to deltaCost may be unchanged in project() [error] Fix bug for EAC Error [error] deterministic behavior on Cluster sets [error] DAG-based global cost function propagates DAC using the current DAC order [error] Correct Z1 bound for Z. [error] correction when saving a problem graph structure into file (skip separators) [error] correction on dead-end elimination residues that might be corrupted in preprocessing [error] correction on dead-end elimination residues that might be corrupted in preprocessing [error] correction on BTD using hybrid best-first search to take into account soft arc consistency cost moves (concerning open node lists) [error] correction of wrong histogram of costs for UAI format reader (may impact VAC performance) [error] correction in hybrid best-first search within BTD in order to compute a correct lower bound between open and closed nodes ; clean open list API [error] correction in DAC reordering using a tree decomposition compatible order [error] correction for UAI MARKOV shift in neperian instead of base 10 [error] bug in ternary (functional) cost functions [error] bug corrections in sregular/wregular ; random generator to test regular/alldiff [error] bug correction in singleton consistency using hbfs [error] bug correction in separator propagate (it has to be delayed when restoring an open node) ; isDelayedNaryCtr set again to true (warning, set to false if using numberjack) [error] Bug correction in randomly generated WCSP solved using VAC [error] Bug correction in randomly generated WCSP solved using VAC [error] bug correction in propagateDAC for global cost functions (enforces DAC order) [error] bug correction in hybrid BTD (ubSon can be lower than current gap, ie it corresponds to a previously found solution) [error] bug correction in hybrid BTD-BFS (wrong long long to double conversion) [error] bug correction in global upper bound update for hybrid BFS [error] bug correction in getCurrentDelta using wrong accelerators isDeltaModified [error] BTD cannot enumerate all solutions for optimization problems [error] add missing vector [error] add deterministic comparators to sets of pointers (else stochastic behavior when iterating) [doc] web section with references mentioning toulbar2 [doc] User documentation embryo. [doc] update toulbar2 tutorial [doc] update doc [doc] toulbar2 website [doc] toulbar2 is now under GNU GENERAL PUBLIC LICENSE! [doc] Making the GPL licence visible in the files (and not only on the forge web site) [doc] improve dev documentation (make doc) and add wcsp format documentation (using firefox print to pdf) [doc] automatic doc examples generation [doc] apt-get install libboost-graph-dev is now required for toulbar2 compilation [error] for debugging only, check optimal solution (-opt) during multiple assignments (assignLS) [code] update license to GNU GPL [code] static sort of cluster sons in tree decomposition based on min separator size then min cluster subtree [code] Slight improvment to the trailing system: let types manage the StoreStack for us and save space [code] Simpler and supposedly improved taintedness detection [code] rename tb2wgrammar into tb2grammarutils [code] rename filename upper to lower cases [code] remove warning if lds used with default hbfs [code] remove tb2rangeminquery.hpp (corresponding class def moved into tb2treeconstr) [code] remove HBFS trace information if negative verbosity [code] remove compilation warnings about uninitialized variables [code] pretty indent code [code] Passage au log néperien. [code] moves Store as static (virtual) class - beware multithreading is not possible, would require different stores [code] moves Store as static (virtual) class - beware multithreading is not possible, would require different stores [code] Linking with jemalloc if desired (default on if available) [code] initial value to switch from depth-first to best-first set to 1 in order to output a first solution more rapidely [code] initial hybrid BFS parameter value set to a power of two (128) [code] improve open node rotation prefering the smallest lower bound, and next, the deepest depth, and next, the oldest time-stamp [code] hybrid best-first BTD keep current visited nodes as open nodes if their gap is not null [code] hbfs renaming and add global hbfs backtrack limit (instead of node limit) [code] Getting closer to the cpd branch: - a TLogProb type is added. It has the same concrete type as TProb - the conversion and summation functions that manipulate TLogProb/cost have new names LogLike -> LogProb SumLogLike -> SumLogExp [code] generic Makefile to be inserted into src directory and type make [code] future evolution of costs storage in nary cost functions [code] debian directory to generate debian source package [code] correct source code indentation without tabs [code] clear open node list by assignment to an empty list [code] cheks compatibility between ToulBar2 options outside tb2main.cpp (needed for numberjack) [code] checks compatibility between options at each solve (needed by Numberjack) [code] check if priority_queue has a circular effect [code] change output solution filename for mendelsoft [code] avoid computing costly variable elimination ordering before first propagation [code] A simple sheel script to build a debian source package. [code] all boost-related code can be desactivated if flag BOOST is not defined [code] add specific flag NUMBERJACK when using toulbar2 within numb [code] add special emacs comments for tab and spaces erjack 0 0 01/01/1970 01:00 Pas de modération
 new-toulbar2-web-site Includes documentations, references, and benchmarks. At http://www.inra.fr/mia/T/toulbar2 0 0 01/01/1970 01:00 Pas de modération
 toulbar2-is-now-in-debian-distribution Toulbar2 is available in unstable, in the debian-science section. See https://packages.debian.org/sid/science/toulbar2. 0 0 01/01/1970 01:00 Pas de modération
Powered By FusionForge