Sciweavers

70 search results - page 7 / 14
» Discrete optimisation and real-world problems
Sort
View
CORR
2012
Springer
185views Education» more  CORR 2012»
13 years 11 months ago
Bayesian network learning with cutting planes
The problem of learning the structure of Bayesian networks from complete discrete data with a limit on parent set size is considered. Learning is cast explicitly as an optimisatio...
James Cussens
111
Voted
DGCI
2006
Springer
15 years 7 months ago
Minimal Decomposition of a Digital Surface into Digital Plane Segments Is NP-Hard
This paper deals with the complexity of the decomposition of a digital surface into digital plane segments (DPS for short). We prove that the decision problem (does there exist a ...
Isabelle Sivignon, David Coeurjolly
PRICAI
2004
Springer
15 years 9 months ago
Solving Over-Constrained Temporal Reasoning Problems Using Local Search
Temporal reasoning is an important task in many areas of computer science including planning, scheduling, temporal databases and instruction optimisation for compilers. Given a kno...
Matthew Beaumont, John Thornton, Abdul Sattar, Mic...
PATAT
2000
Springer
123views Education» more  PATAT 2000»
15 years 7 months ago
A Multicriteria Approach to Examination Timetabling
The main aim of this paper is to consider university examination timetabling problems as multicriteria decision problems. A new multicriteria approach to solving such problems is p...
Edmund K. Burke, Yuri Bykov, Sanja Petrovic
ERCIMDL
2000
Springer
147views Education» more  ERCIMDL 2000»
15 years 7 months ago
Map Segmentation by Colour Cube Genetic K-Mean Clustering
Segmentation of a colour image composed of different kinds of texture regions can be a hard problem, namely to compute for an exact texture fields and a decision of the optimum num...
Vitorino Ramos, Fernando Muge