Sciweavers

1760 search results - page 95 / 352
» Connected Set Cover Problem and Its Applications
Sort
View
ASC
2004
13 years 8 months ago
Adaptive reconfiguration of data networks using genetic algorithms
Genetic algorithms are applied to an important, but little-investigated, network design problem, that of reconfiguring the topology and link capacities of an operational network t...
David J. Montana, Talib S. Hussain
DAM
2008
114views more  DAM 2008»
13 years 8 months ago
Efficient solutions to the braid isotopy problem
We describe the most efficient solutions to the word problem of Artin's braid group known so far, i.e., in other words, the most efficient solutions to the braid isotopy probl...
Patrick Dehornoy
GIS
2010
ACM
13 years 6 months ago
Using location based social networks for quality-aware participatory data transfer
The sensing systems that monitor physical environments rely on communication infrastructures (wired or wireless) to collect data from the sensors embedded in the environment. Howe...
Houtan Shirani-Mehr, Farnoush Banaei Kashani, Cyru...
FOCS
2010
IEEE
13 years 6 months ago
The Coin Problem and Pseudorandomness for Branching Programs
The Coin Problem is the following problem: a coin is given, which lands on head with probability either 1/2 + or 1/2 - . We are given the outcome of n independent tosses of this co...
Joshua Brody, Elad Verbin
WSC
2001
13 years 9 months ago
Constrained Monte Carlo and the method of control variates
A constrained Monte Carlo problem arises when one computes an expectation in the presence of a priori computable constraints on the expectations of quantities that are correlated ...
Roberto Szechtman, Peter W. Glynn