3 citations found. Retrieving documents...
I. Gent and T. Walsh. 1997. From approximate to optimal solutions: Constructing pruning and propagation rules. In Proceedings of IJCAI 97. In press.

 Home/Search   Document Details and Download   Summary   Related Articles   Check  

This paper is cited in the following contexts:
A New Local Search Algorithm Providing High Quality Solutions to.. - Shaw (1997)   (2 citations)  (Correct)

....It is generally believed, and recently been shown [9] that an effective variable ordering strategy is to instantiate more constrained variables first. Of course, constrainedness is a problem dependent attribute, but some mathematical descriptions of it can be found for simple random problems [10, 11]. In our context, a variable (visit) could be considered constrained if it has very few available insertion points, or that many of its insertion points incur a high cost. Less work has been performed on value ordering heuristics, but a study in [7] provides strong evidence to indicate that ....

I. Gent and T. Walsh. From approximate to optimal solutions: Constructing pruning and propagation rules. In Proceedings of the 15th IJCAI, 1997.


How Not To Do It - Gent, Grant, MacIntyre, Prosser.. (1997)   (8 citations)  Self-citation (Gent Walsh)   (Correct)

....and Walsh 1993a, Gent and Walsh 1993b] using code of intermediate efficiency. Your code has got to be fast enough to do what you need: it need not be the fastest in the world. Occasionally we have inadvertently gone too far in this direction. For example, when studying the scaling of search cost [Gent et al. 1997] we accidentally ran interpreted rather than compiled Lisp, for a fifty fold slowdown. So Do compile code. Do use version control The software systems we use to conduct our empirical studies are inevitably large and complex. A typical experimental system might be made up of fifteen or more ....

....with colleagues or system administrators. The irony is that it is often on just these occasions that the results were unimportant anyway. This is particularly true where scaling methods such as finite size scaling are available, enabling results from smaller sizes to be extrapolated accurately [Gent et al. 1997]. So Do look for scaling results. They can often be found from data involving surprisingly small problem sizes and samples. Do be stupid Apparently stupid experiments can sometimes give fascinating results. For example, one of the fundamental features of GSAT is the greediness of its ....

[Article contains additional citation context not shown here]

I. Gent and T. Walsh. 1997. From approximate to optimal solutions: Constructing pruning and propagation rules. In Proceedings of IJCAI 97. In press.


Using Constraint Programming and Local Search Methods to Solve.. - Shaw (1998)   (47 citations)  (Correct)

No context found.

I. Gent and T. Walsh. From approximate to optimal solutions: Constructing pruning and propagation rules. In Proceedings of the 15th IJCAI, 1997.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC