Sciweavers

2109 search results - page 80 / 422
» Solving Necklace Constraint Problems
Sort
View
CORR
2010
Springer
124views Education» more  CORR 2010»
15 years 4 months ago
Symmetry within and between solutions
Symmetry can be used to help solve many problems. For instance, Einstein's famous 1905 paper ("On the Electrodynamics of Moving Bodies") uses symmetry to help derive...
Toby Walsh
176
Voted
ISPD
1997
ACM
186views Hardware» more  ISPD 1997»
15 years 8 months ago
EWA: exact wiring-sizing algorithm
The wire sizing problem under inequality Elmore delay constraints is known to be posynomial, hence convex under an exponential variable-transformation. There are formal methods fo...
Rony Kay, Gennady Bucheuv, Lawrence T. Pileggi
ICIP
2009
IEEE
16 years 5 months ago
An Overview Of Inverse Problem Regularization Using Sparsity
Sparsity constraints are now very popular to regularized inverse problems. We review several approaches which have been proposed in the last ten years to solve inverse problems su...
CP
2005
Springer
15 years 10 months ago
CP(Graph): Introducing a Graph Computation Domain in Constraint Programming
Abstract. In an increasing number of domains such as bioinformatics, combinatorial graph problems arise. We propose a novel way to solve these problems, mainly those that can be tr...
Grégoire Dooms, Yves Deville, Pierre Dupont
130
Voted
ANTSW
2008
Springer
15 years 6 months ago
Integration of ACO in a Constraint Programming Language
We propose to integrate ACO in a Constraint Programming (CP) language. Basically, we use the CP language to describe the problem to solve by means of constraints and we use the CP ...
Madjid Khichane, Patrick Albert, Christine Solnon