75 search results - page 2 / 15 » Using DNA to solve the Bounded Post Correspondence Problem |
ICCAD
1997
IEEE
13 years 11 months ago
1997
IEEE
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...
COR
2007
13 years 7 months ago
2007
This paper presents several Arcs-States models that can be applied to numerous vehicle routing problems, one of which is the well-known vehicle routing problem with capacities and...
ICDM
2006
IEEE
14 years 1 months ago
2006
IEEE
The problem of discovering arrangements of regions of high occurrence of one or more items of a given alphabet in a sequence, is studied, and two efficient approaches are propose...
MOC
1998
13 years 7 months ago
1998
In this paper we construct and analyze new non-overlapping domain decomposition preconditioners for the solution of second-order elliptic and parabolic boundary value problems. The...
ESANN
2006
13 years 8 months ago
2006
The Blind Source Separation (BSS) problem is often solved by maximizing objective functions reflecting the statistical dependency between outputs. Since global maximization may be ...