914 search results - page 46 / 183 » Branch and Bound on the Network Model |
191
click to vote
ECAI
2008
Springer
15 years 8 months ago
2008
Springer
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...
167
click to vote
WS
2006
ACM
16 years 7 days ago
2006
ACM
In this paper, we propose a formal notion of network security for ad hoc networks. We adopt a probabilistic security framework, that is, security is defined by a polynomially bou...
197
click to vote
NIPS
1997
15 years 7 months ago
1997
We study on-line generalized linear regression with multidimensional outputs, i.e., neural networks with multiple output nodes but no hidden nodes. We allow at the final layer tra...
152
click to vote
WSC
2007
15 years 8 months ago
2007
This paper describes an innovative framework, iFAOSimo, which integrates optimization, simulation and GIS (geographic information system) techniques to handle complex spatial faci...
183
click to vote
ICC
2009
IEEE
15 years 4 months ago
2009
IEEE
We demonstrate that the gain attained by network coding (NC) on the multicast capacity of random wireless ad hoc networks is bounded by a constant factor. We consider a network wit...