Sciweavers

1480 search results - page 209 / 296
» Ants can solve constraint satisfaction problems
Sort
View
ESA
2005
Springer
176views Algorithms» more  ESA 2005»
15 years 12 months ago
On Degree Constrained Shortest Paths
Abstract. Traditional shortest path problems play a central role in both the design and use of communication networks and have been studied extensively. In this work, we consider a...
Samir Khuller, Kwangil Lee, Mark A. Shayman
CIA
2006
Springer
15 years 10 months ago
Coverage Density as a Dominant Property of Large-Scale Sensor Networks
Large-scale sensor networks are becoming more present in our life then ever. Such an environment could be a cellular network, an array of fire detection sensors, an array of solar ...
Osher Yadgar, Sarit Kraus
TCOM
2010
102views more  TCOM 2010»
15 years 4 months ago
A system performance approach to OSNR optimization in optical networks
Abstract—This paper studies a constrained optical signal-tonoise ratio (OSNR) optimization problem in optical networks from the perspective of system performance. A system optimi...
Yan Pan, Tansu Alpcan, Lacra Pavel
JMLR
2010
149views more  JMLR 2010»
15 years 1 months ago
Learning Bayesian Network Structure using LP Relaxations
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...
Tommi Jaakkola, David Sontag, Amir Globerson, Mari...
INFOCOM
2011
IEEE
14 years 9 months ago
Delay constrained minimum energy broadcast in cooperative wireless networks
—We formulate the problem of delay constrained energy-efficient broadcast in cooperative multihop wireless networks. We show that this important problem is not only NPcomplete, ...
Marjan A. Baghaie, Bhaskar Krishnamachari