#### Filter Results:

- Full text PDF available (4)

#### Publication Year

2005

2015

- This year (0)
- Last 5 years (2)
- Last 10 years (2)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Stephen Gilmour, Mark Dras
- ANTS Workshop
- 2006

For solving combinatorial optimisation problems, exactmethods accurately exploit the structure of the problem but are tractable only up to a certain size; approximation or heuristic methods are tractable for very large problems butmay possibly be led into a bad solution. A question that arises is, From where can we obtain knowledge of the problem structure… (More)

- T Ganchimeg, R Mori, +8 authors J P Souza
- BJOG : an international journal of obstetrics and…
- 2013

OBJECTIVE
To investigate the risk of adverse pregnancy outcomes and caesarean section among adolescents in low- and middle-income countries.
DESIGN
Secondary analysis using facility-based cross-sectional data from the World Health Organization (WHO) Global Survey on Maternal and Perinatal Health.
SETTING
Twenty-three countries in Africa, Latin America,… (More)

- M M Rahman, S K Abe, +6 authors K Shibuya
- Obesity reviews : an official journal of the…
- 2015

We conducted a systematic review and meta-analysis of population-based cohort studies of maternal body mass index (BMI) and risk of adverse birth and health outcomes in low- and middle-income countries. PubMed, Embase, CINAHL and the British Nursing Index were searched from inception to February 2014. Forty-two studies were included. Our study found that… (More)

- Stephen Gilmour, Mark Dras
- Australian Conference on Artificial Intelligence
- 2005

Ant Colony Optimization (ACO) is a collection of metaheuristics inspired by foraging in ant colonies, whose aim is to solve combinatorial optimization problems. We identify some principles behind the metaheuristics’ rules; and we show that ensuring their application, as a correction to a published algorithm for the vertex cover problem, leads to a… (More)

- Stephen Gilmour, Mark Dras
- 2006

For solving combinatorial optimisation problems, exact methods accurately exploit the structure of the problem but are tractable only up to a certain size; approximation or heuristic methods are tractable for very large problems but may possibly be led into a bad solution. A question that arises is, From where can we obtain knowledge of the problem… (More)

- Stephen Gilmour, Mark Dras
- ACSC
- 2005

One approach to tractably finding a solution to an NP-complete optimisation problem is heuristic, where the solution is inexact but quickly found; another approach is to reduce the problem in such a way that the reduction has the same solution as the original but is simpler, and then to solve the reduction, noting that this reduction is still NP-complete.… (More)

- ‹
- 1
- ›