7065 search results - page 1199 / 1413 » Iterative Scheduling Algorithms |
170
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
175
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract--This paper considers the noncooperative maximization of mutual information in the Gaussian interference channel in a fully distributed fashion via game theory. This probl...
146
click to vote
JSAC
2006
15 years 6 months ago
2006
Abstract--We consider using traceroute-like end-to-end measurement to infer the underlay topology for a group of hosts. One major issue is the measurement cost. Given hosts in an a...
202
click to vote
FMSD
2007
15 years 6 months ago
2007
Symbolic techniques based on Binary Decision Diagrams (BDDs) are widely employed for reasoning about temporal properties of hardware circuits and synchronous controllers. However, ...
193
click to vote
AI
2002
Springer
15 years 6 months ago
2002
Springer
Automated negotiation is a key form of interaction in systems that are composed of multiple autonomous agents. The aim of such interactions is to reach agreements through an itera...