1964 search results - page 31 / 393 » Partitioning Based Algorithms for Some Colouring Problems |
SAC
2008
ACM
13 years 7 months ago
2008
ACM
We consider analysis of complex stochastic models based upon partial information. MCMC and reversible jump MCMC are often the methods of choice for such problems, but in some situ...
ASPDAC
2006
ACM
14 years 1 months ago
2006
ACM
This paper advances a new methodology based on signal-path information to resolve the problem of device-level placement for analog layout. This methodology is mainly based on three...
GECCO
2004
Springer
14 years 1 months ago
2004
Springer
This paper discusses the implementation of local search in evolutionary multiobjective optimization (EMO) algorithms for the design of a simple but powerful memetic EMO algorithm. ...
CP
2006
Springer
13 years 11 months ago
2006
Springer
We consider probabilistic constrained linear programs with general distributions for the uncertain parameters. These problems generally involve non-convex feasible sets. We develo...
AUSAI
2003
Springer
14 years 28 days ago
2003
Springer
Abstract. The RGCP (Robust Graph Coloring problem) is a new variant of the traditional graph coloring problem. It has numerous practical applications in real world like timetabling...