68 search results - page 11 / 14 » A Reach and Bound algorithm for acyclic dynamic-programming ... |
ADHOCNOW
2008
Springer
14 years 1 months ago
2008
Springer
We study two algorithmical problems inspired from routing constraints in a multihop synchronous radio network. Our objective is to satisfy a given set of communication requests in ...
ESORICS
2000
Springer
13 years 10 months ago
2000
Springer
The ATM technology has been specified to provide users with the ability to request quality of service (QoS) for their applicatio ns and to enable high speed communications. Howeve...
GECCO
2008
Springer
13 years 7 months ago
2008
Springer
Scheduling collective communications (CC) in networks based on optimal graphs and digraphs has been done with the use of the evolutionary techniques. Inter-node communication patt...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Bargaining networks model the behavior of a set of players who need to reach pairwise agreements for making profits. Nash bargaining solutions in this context correspond to soluti...
INFOCOM
2002
IEEE
13 years 11 months ago
2002
IEEE
—Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands...