#### Filter Results:

- Full text PDF available (28)

#### Publication Year

2004

2016

- This year (0)
- Last 5 years (19)
- Last 10 years (31)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched) steal from threads that still have work. Work stealing not only allows for dynamic load balancing, but also determines which parts of the search tree are searched next. Thus the place from where work is stolen has a dramatic effect on… (More)

- Geoffrey Chu, Aaron Harwood, Peter J. Stuckey
- JSAT
- 2009

Current SAT solvers are well engineered and highly efficient, and significant research effort has been put into creating data structures that can produce maximal efficiency for the core propagation engine within SAT solvers. However, there is still substantial room for improvement. As the disparity between CPU speeds and cache sizes have increased, cache… (More)

- Christopher Kai-Shun Leung, Arthur Chak Kwan Cheng, +8 authors Dennis Shun Chiu Lam
- Investigative ophthalmology & visual science
- 2007

PURPOSE
To evaluate the relationships between optic disc measurements, obtained by an optical coherence tomograph and a confocal scanning laser ophthalmoscope, and myopia.
METHODS
One hundred thirty-three eyes from 133 healthy subjects with mean spherical equivalent -6.0 +/- 4.2 D (range, -13.13 to +3.25 D) were analyzed. Optic disc measurements including… (More)

- Geoffrey Chu
- 2011

- Geoffrey Chu, Peter J. Stuckey
- CP
- 2009

We describe a new exact solver for the minimization of open stacks problem (MOSP). By combining nogood recording with a branch and bound strategy based on choosing which customer stack to close next, our solver is able to solve hard instances of MOSP some 5-6 orders of magnitude faster than the previous state of the art. We also derive several pruning… (More)

Lazy clause generation is a powerful approach to reducing search in constraint programming. This is achieved by recording sets of domain restrictions that previously led to failure as new clausal propagators. Symmetry breaking approaches are also powerful methods for reducing search by recognizing that parts of the search tree are symmetric and do not need… (More)

- Geoffrey Chu, Maria Garcia de la Banda, Peter J. Stuckey
- CPAIOR
- 2010

Many search problems contain large amounts of redundancy in the search. In this paper we examine how to automatically exploit remaining subproblem equivalence, which arises when two different search paths lead to identical remaining subproblems, that is the problem left on the remaining unfixed variables. Subproblem equivalence is exploited by caching… (More)

- Andreas Schutt, Geoffrey Chu, Peter J. Stuckey, Mark Wallace
- CPAIOR
- 2012

The Resource-constrained Project Scheduling Problem (Rcpsp), in which a schedule must obey the resource constraints and the precedence constraints between pairs of activities, is one of the most studied scheduling problems. An important variation of the problem (RcpspDc) is to find a schedule which maximises the net present value (discounted cash flow),… (More)

The Maximum Density Sill-Life Problem is to fill an n × n board of cells with the maximum number of live cells so that the board is stable under the rules of Conway’s Game of Life. We reformulate the problem into one of minimising “wastage” rather than maximising the number of live cells. This reformulation allows us to compute strong upper bounds on the… (More)

- Maria Garcia de la Banda, Peter J. Stuckey, Geoffrey Chu
- INFORMS Journal on Computing
- 2011

We give a dynamic programming solution to the problem of scheduling scenes to minimize the cost of the talent. Starting from a basic dynamic program, we show a number of ways to improve the dynamic programming solution, by preprocessing and restricting the search. We show how by considering a bounded version of the problem, and determining lower and upper… (More)