1197 search results - page 221 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
INFOCOM
2002
IEEE
14 years 28 days 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...
INFOCOM
2006
IEEE
14 years 2 months ago
2006
IEEE
Abstract—This paper solves the joint power control and SIR assignment problem through distributed algorithms in the uplink of multi-cellular wireless networks. The 1993 Foschini-...
NIPS
1998
13 years 9 months ago
1998
In this paper, we consider Markov Decision Processes (MDPs) with error states. Error states are those states entering which is undesirable or dangerous. We define the risk with re...
INFOCOM
1995
IEEE
13 years 11 months ago
1995
IEEE
Establishing a multicast tree in a point-to-point network of switch nodes, such as a wide-area ATM network, is often modeled as the NP-complete Steiner problem in networks. In thi...
JCO
2011
13 years 3 months ago
2011
Discrete gate sizing is a critical optimization in VLSI circuit design. Given a set of available gate sizes, discrete gate sizing problem asks to assign a size to each gate such th...