1002 search results - page 133 / 201 » Constraint Answer Set Solving |
149
click to vote
CLUSTER
2007
IEEE
16 years 15 days ago
2007
IEEE
— The service-oriented architecture has come a long way in solving the problem of reusability of existing software resources. Grid applications today are composed of a large numb...
212
click to vote
EVOW
2007
Springer
16 years 10 days ago
2007
Springer
Abstract. The Traveling Salesman Problem (TSP) is a well-known NPhard combinatorial optimization problem, for which a large variety of evolutionary algorithms are known. However, t...
172
click to vote
FMCAD
2007
Springer
16 years 10 days ago
2007
Springer
We present a formulation of retiming to minimize the number of registers in a design by iterating a maximum network flow problem. The retiming returned will be the optimum one whi...
162
click to vote
EMMCVPR
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Reverse-convex programming (RCP) concerns global optimization of a specific class of non-convex optimization problems. We show that a recently proposed model for sparse ...
147
click to vote
IBPRIA
2005
Springer
15 years 11 months ago
2005
Springer
This paper presents a method for the detection of multiple concentric circles which is based on the Hough Transform (HT). In order to reduce time and memory space the concentric ci...