1329 search results - page 90 / 266 » Models and solution techniques for frequency assignment prob... |
146
click to vote
EOR
2002
15 years 6 months ago
2002
The assignment of alternatives (observations/objects) into predefined homogenous groups is a problem of major practical and research interest. This type of problem is referred to ...
180
click to vote
GECCO
2005
Springer
15 years 12 months ago
2005
Springer
Memetic algorithms have become to gain increasingly important for solving large scale combinatorial optimization problems. Typically, the extent of the application of local search...
146
click to vote
ISPD
1999
ACM
15 years 10 months ago
1999
ACM
—This paper studies a natural formulation of the timing-driven maze routing problem. A multigraph model appropriate for global routing applications is adopted; the model naturall...
183
click to vote
WLP
2004
Springer
15 years 11 months ago
2004
Springer
Constraint programming provides a declarative approach to solving combinatorial (optimization) problems. The user just states the problem as a constraint satisfaction problem (CSP)...
144
click to vote
VLDB
1997
ACM
15 years 10 months ago
1997
ACM
The enhanced pay-per-view (EPPV) model for providing continuous-media-on-demand(CMOD) services associates with each continuous media clip a display frequency that dependson the cl...