nevin l zhang cahicfcsusthk dear max thanks clarification statement review one paper mine regards nevin max chickering wrote hi nevin mean competitive youre referring run time ges considers different parts search space discuss paper algorithm take longer dag search typically evaluates neighbors state paper found ges slower factor two reason understand theres bad free implementations floating around eg matlab slow unfortunately given ges algorithm bad reputation terms run time implemented correctly zero overhead using equivalenceclass representation scoring operators evaluated exactly edge modifications dag important property ges evaluates set solutions dagbased search algorithm run time identical implemented prescribed paper suppose misconception fault providing public implementation ges believe paper spell pretty clearly implement algorithm youre referring solution quality found experiments vanilla greedy dag search sparse domains max original message nhipljlbixengrorstedu mailtonhipljlbixengrorstedu behalf nevin l zhang sent wednesday june 08 2005 858 uia subject uai statement ges anyone comments following statement ges nice theoretical properties data plentiful really competitive practice uai mailing list wed 06 aug 2008 201800 0800 uai statement ges