1022 search results - page 104 / 205 » Challenges for Constraint Programming in Networking |
83
Voted
CEC
2005
IEEE
15 years 6 months ago
2005
IEEE
Abstract- Finding Golomb rulers is an extremely challenging optimization problem (with many practical applications) that has been approached by a variety of search methods in recen...
97
Voted
NETCOOP
2007
Springer
15 years 6 months ago
2007
Springer
In shortest path routing, traffic is routed along shortest paths defined by link weights. However, not all path systems are feasible in that they can be realized in this way. This...
ANCS
2008
ACM
15 years 2 months ago
2008
ACM
Over the last decade, programmable Network Processors (NPs) have become widely used in Internet routers and other network components. NPs enable rapid development of complex packe...
112
Voted
SIAMSC
2010
14 years 11 months ago
2010
A recursive acceleration method is proposed for multiplicative multilevel aggregation algorithms that calculate the stationary probability vector of large, sparse, and irreducible ...
107
Voted
JPDC
2000
15 years 14 days ago
2000
In this paper, we study optical multistage interconnection networks (MINs). Advances in electro-optic technologies have made optical communication a promising networking choice to...