News

Releasing FRODO version 2.16 (synchronous Max-Sum)

P2-DPOP & MPC-DisWCSP4 now support maximization problems and problems with negative costs/utilities (request by Sankarshan Damle).
Max-Sum now supports synchronous, round-based execution (in addition to asynchronous execution). Preliminary experimental results show that the asynchronous version outperforms the synchronous version on all performance metrics (see below).

Fixed a bug in the CATS parser triggered by negative bid values from bidders with multiple bids (reported by Sankarshan Damle).

Max-Sum now optionally introduces perturbations to the problem to improve solution quality.
The resulting empirical improvements are reported below on graph coloring and on meeting scheduling problems.
The distributed submode now support a non-omniscient controller, in which case the configuration files are fed directly to the daemons (support request #10 by Andrea).
The XCSPparser's main function can now split an overall problem into each agent's respective subproblem (support request #10 by Andrea).

Fixed bugs in MGM & MGM2 following which, when measuring convergence, more data points than necessary were collected.
Minor code cleanups.

Major performance improvement in the way DPOP's UTIL messages are implemented in JaCoP (performance issue reported by Chirag Vartak). UTIL lookups are now cheaper (constant instead of linear in the number of allowed tuples), resulting in multiple-times speedups - see chart below on graph coloring problems.
Fixed a bug in the random graph coloring problem generator, following which the unary constraints (when tightness > 0) used an inconsistent color numbering convention (bug reported by Duc Thien Nguyen).

Page 2 of 2