Sciweavers

2412 search results - page 305 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
GECCO
2009
Springer
156views Optimization» more  GECCO 2009»
15 years 10 months ago
Insight knowledge in search based software testing
Software testing can be re-formulated as a search problem, hence search algorithms (e.g., Genetic Algorithms) can be used to tackle it. Most of the research so far has been of emp...
Andrea Arcuri
118
Voted
ICC
2007
IEEE
120views Communications» more  ICC 2007»
15 years 9 months ago
On the Tails of the Distribution of the Sum of Lognormals
—Finding the distribution of the sum of lognormal We assume in this paper that the terms Yi are independent. The random variables is an important mathematical problem in probabil...
Sebastien S. Szyszkowicz, Halim Yanikomeroglu
COR
2007
143views more  COR 2007»
15 years 3 months ago
Discrete bandwidth allocation considering fairness and transmission load in multicast networks
As a promising solution to tackle the network heterogeneity in multicasting, layered multicast protocols such as Receiver-driven layered multicast (RLM) and Layered video multicas...
Chae Y. Lee, Hee K. Cho
JUCS
2008
119views more  JUCS 2008»
15 years 3 months ago
A Standards-based Modelling Approach for Dynamic Generation of Adaptive Learning Scenarios
: One of the key problems in developing standard based adaptive courses is the complexity involved in the design phase, especially when establishing the hooks for the dynamic model...
Jesus Boticario, Olga C. Santos
169
Voted
MST
2010
187views more  MST 2010»
14 years 10 months ago
Distributed Approximation of Capacitated Dominating Sets
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
Fabian Kuhn, Thomas Moscibroda