1480 search results - page 196 / 296 » Ants can solve constraint satisfaction problems |
166
click to vote
NGC
2000
Springer
15 years 10 months ago
2000
Springer
We examine the use of a hop-limit constraint with techniques to provide survivability for connection-oriented ATM group communications. A hop-limit constraint is an approach that ...
178
click to vote
FMCAD
2007
Springer
16 years 21 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
WCE
2007
15 years 7 months ago
2007
—In the design process of complex systems, the designer is solving an optimization problem, which involves different disciplines and where all design criteria have to be optimize...
177
click to vote
COMCOM
2004
15 years 6 months ago
2004
The optimal multiple multicast problem (OMMP) on wavelength division multiplexing ring networks without wavelength conversion is considered in this paper. When the physical networ...
183
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Index tuning, i.e., selecting the indexes appropriate for a workload, is a crucial problem in database system tuning. In this paper, we solve index tuning for large problem instan...