JAIR
2010
13 years 7 months ago
2010
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 ...
ENDM
2010
13 years 9 months ago
2010
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...
ICCAD
2009
IEEE
13 years 10 months ago
2009
IEEE
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...
DISOPT
2007
14 years 12 days ago
2007
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...
WSC
1998
14 years 1 months ago
1998
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...
AIPS
2004
14 years 1 months ago
2004
This paper considers the problem of generating partial order schedules (
AUSAI
2009
Springer
14 years 3 months ago
2009
Springer
Regressions has successfully been incorporated into memetic algorithm (MA) to build surrogate models for the objective or constraint landscape of optimization problems. This helps ...
AINA
2004
IEEE
14 years 4 months ago
2004
IEEE
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...
ISCAS
1999
IEEE
14 years 4 months ago
1999
IEEE
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...
GECCO
2005
Springer
14 years 6 months ago
2005
Springer
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...