1984 search results - page 102 / 397 » The colourful feasibility problem |
PROCEDIA
2010
13 years 8 months ago
2010
Visualising computational simulation models of solid state physical systems is a hard problem for dense lattice models. Fly throughs and cutaways can aid viewer understanding of a...
BMVC
2010
13 years 8 months ago
2010
Markov random field pixel labelling is often used to obtain image segmentations in which each segment or region is labelled according to its attributes such as colour or texture. ...
ANOR
2011
13 years 5 months ago
2011
Hard problems for metaheuristic search can be a source of insight for developing better methods. We examine a challenging instance of such a problem that has exactly two local opt...
ICSE
2007
IEEE-ACM
14 years 10 months ago
2007
IEEE-ACM
The paper presents a novel approach based on Bogor for the accurate verification of applications based on PublishSubscribe infrastructures. Previous efforts adopted standard model...
EVOW
2009
Springer
14 years 4 months ago
2009
Springer
In a recent paper an algorithm for solving MAX-SAT was proposed which worked by clustering good solutions and restarting the search from the closest feasible solutions. This was sh...