Sciweavers

1404 search results - page 147 / 281
» Optimization problems in multiple-interval graphs
Sort
View
ISPD
2010
ACM
249views Hardware» more  ISPD 2010»
15 years 4 months ago
A matching based decomposer for double patterning lithography
Double Patterning Lithography (DPL) is one of the few hopeful candidate solutions for the lithography for CMOS process beyond 45nm. DPL assigns the patterns less than a certain di...
Yue Xu, Chris Chu
GECCO
2010
Springer
218views Optimization» more  GECCO 2010»
15 years 1 months ago
Cartesian genetic programming
This paper presents a new form of Genetic Programming called Cartesian Genetic Programming in which a program is represented as an indexed graph. The graph is encoded in the form o...
Julian Francis Miller, Simon L. Harding
GECCO
2008
Springer
141views Optimization» more  GECCO 2008»
14 years 11 months ago
A study of NK landscapes' basins and local optima networks
We propose a network characterization of combinatorial fitness landscapes by adapting the notion of inherent networks proposed for energy surfaces [5]. We use the well-known fami...
Gabriela Ochoa, Marco Tomassini, Sébastien ...
ICCS
2009
Springer
15 years 4 months ago
Distinguishing Answers in Conceptual Graph Knowledge Bases
Abstract. In knowledge bases, the open world assumption and the ability to express variables may lead to an answer redundancy problem. This problem occurs when the returned answers...
Nicolas Moreau, Michel Leclère, Madalina Cr...
CVPR
2008
IEEE
15 years 12 months ago
Graph cut with ordering constraints on labels and its applications
In the last decade, graph-cut optimization has been popular for a variety of pixel labeling problems. Typically graph-cut methods are used to incorporate a smoothness prior on a l...
Xiaoqing Liu, Olga Veksler, Jagath Samarabandu