Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
JAIR
2010
130views more  JAIR 2010»
10 years 12 months ago
Interactive Cost Configuration Over Decision Diagrams
In many AI domains such as product configuration, a user should interactively specify a solution that must satisfy a set of constraints. In such scenarios, offline compilation of ...
Henrik Reif Andersen, Tarik Hadzic, David Pisinger
ENDM
2010
112views more  ENDM 2010»
11 years 2 months ago
On the complexity of the Eulerian closed walk with precedence path constraints problem
The Eulerian closed walk problem in a digraph is a well-known polynomial-time solvable problem. In this paper, we show that if we impose the feasible solutions to fulfill some pre...
Hervé Kerivin, Mathieu Lacroix, Ali Ridha M...
ICCAD
2009
IEEE
151views Hardware» more  ICCAD 2009»
11 years 2 months ago
GREMA: Graph reduction based efficient mask assignment for double patterning technology
Double patterning technology (DPT) has emerged as the most hopeful candidate for the next technology node of the ITRS roadmap [1]. The goal of a DPT decomposer is to decompose the...
Yue Xu, Chris Chu
DISOPT
2007
93views more  DISOPT 2007»
11 years 5 months ago
A feasibility pump heuristic for general mixed-integer problems
Finding a feasible solution of a given Mixed-Integer Programming (MIP) model is a very important (NP-complete) problem that can be extremely hard in practice. Very recently, Fisch...
Livio Bertacco, Matteo Fischetti, Andrea Lodi
WSC
1998
11 years 6 months ago
Properties of Synthetic Optimization Problems
In this paper, we present an approach for measuring certain properties of synthetic optimization problems based on the assumed distribution of coefficient values. We show how to e...
Charles H. Reilly
AIPS
2004
11 years 6 months ago
Generating Robust Schedules through Temporal Flexibility
This paper considers the problem of generating partial order schedules (
Nicola Policella, Stephen F. Smith, Amedeo Cesta, ...
AUSAI
2009
Springer
11 years 8 months ago
Classification-Assisted Memetic Algorithms for Equality-Constrained Optimization Problems
Regressions has successfully been incorporated into memetic algorithm (MA) to build surrogate models for the objective or constraint landscape of optimization problems. This helps ...
Stephanus Daniel Handoko, Chee Keong Kwoh, Yew-Soo...
AINA
2004
IEEE
11 years 9 months ago
On the Performance of Heuristic H MCOP for Multi-Constrained Optimal-Path QoS Routing
Network services for finding a feasible or an optimal path subject to multiple constraints on performance metrics such as delay, jitter, loss probability, etc. give rise to multip...
Gang Feng
ISCAS
1999
IEEE
95views Hardware» more  ISCAS 1999»
11 years 9 months ago
Evaluating iterative improvement heuristics for bigraph crossing minimization
The bigraph crossing problem, embedding the two node sets of a bipartite graph G = V0;V1;E along two parallel lines so that edge crossings are minimized, has application to placeme...
Matthias F. M. Stallmann, Franc Brglez, Debabrata ...
GECCO
2005
Springer
125views Optimization» more  GECCO 2005»
11 years 10 months ago
Improving EA-based design space exploration by utilizing symbolic feasibility tests
This paper will propose a novel approach in combining Evolutionary Algorithms with symbolic techniques in order to improve the convergence of the algorithm in the presence of larg...
Thomas Schlichter, Christian Haubelt, Jürgen ...
books