2266 search results - page 122 / 454 » Some Solutions to the Ignoring Problem |
100
click to vote
GECCO
2009
Springer
15 years 8 months ago
2009
Springer
This paper introduces a new component based model that makes it relatively simple to prove that certain types of landscapes are elementary. We use the model to reconstruct proofs ...
135
click to vote
DATE
2004
IEEE
15 years 5 months ago
2004
IEEE
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...
119
click to vote
JOTA
2011
14 years 8 months ago
2011
: Nowadays, solving nonsmooth (not necessarily differentiable) optimization problems plays a very important role in many areas of industrial applications. Most of the algorithms d...
118
click to vote
ICCSA
2005
Springer
15 years 7 months ago
2005
Springer
We discuss the deletion of a single vertex in a Delaunay tetrahedralization (DT). While some theoretical solutions exist for this problem, the many degeneracies in three dimensions...
105
click to vote
CP
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. In many situations, a set of hard constraints encodes the feasible configurations of some system or product over which users have preferences. We consider the problem of...