117 search results - page 17 / 24 » Hybrid constructive heuristics for the critical node problem |
145
click to vote
GECCO
2007
Springer
15 years 4 months ago
2007
Springer
Bayesian Networks are today used in various fields and domains due to their inherent ability to deal with uncertainty. Learning Bayesian Networks, however is an NP-Hard task [7]....
MIDDLEWARE
2009
Springer
15 years 5 months ago
2009
Springer
The innate dynamicity and complexity of mobile ad-hoc networks (MANETs) has resulted in numerous ad-hoc routing protocols being proposed. Furthermore, numerous variants and hybrids...
CONSTRAINTS
2006
14 years 10 months ago
2006
Abstract. The Still-Life problem is challenging for CP techniques because the basic constraints of the game of Life are loose and give poor propagation for Still-Life. In this pape...
IWDC
2005
Springer
15 years 3 months ago
2005
Springer
For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, calle...
107
click to vote
TON
2008
14 years 10 months ago
2008
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...