914 search results - page 5 / 183 » Branch and Bound on the Network Model |
KBSE
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract—Many applications are concurrent and communicate over a network. The non-determinism in the thread and communication schedules makes it desirable to model check such sys...
ICMLA
2007
13 years 8 months ago
2007
We introduce a polynomial-time algorithm to learn Bayesian networks whose structure is restricted to nodes with in-degree at most k and to edges consistent with the optimal branch...
COR
2007
13 years 7 months ago
2007
This paper presents several Arcs-States models that can be applied to numerous vehicle routing problems, one of which is the well-known vehicle routing problem with capacities and...
INFORMS
2008
13 years 7 months ago
2008
We propose an exact solution method for a routing and capacity installation problem in networks. Given an input graph, the problem is to route traffic from a set of source nodes t...
EOR
2002
13 years 7 months ago
2002
We present a genetic algorithm for heuristically solving a cost minimization problem applied to communication networks with threshold based discounting. The network model assumes t...