2109 search results - page 201 / 422 » Solving Necklace Constraint Problems |
181
click to vote
QOSIP
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. The topological design of distributed packet switched networks consists of finding a topology that minimizes the communication costs by taking into account a certain num...
155
click to vote
CISS
2008
IEEE
16 years 29 days ago
2008
IEEE
Motivated to design a feasible optical network architecture for the future Internet, we address the question of scheduling (wavelength assignment) in an optical network. The key ch...
184
click to vote
PR
2010
15 years 4 months ago
2010
Most existing representative works in semi-supervised clustering do not sufficiently solve the violation problem of pairwise constraints. On the other hand, traditional kernel met...
181
click to vote
IOR
2007
15 years 6 months ago
2007
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
136
click to vote
ERSA
2006
15 years 8 months ago
2006
: A brief review of mapping generalized template matching operations onto reconfigurable computers is given. A combinatorial optimization process, where the objective is to minimiz...