Sciweavers

5973 search results - page 196 / 1195
» Fundamental forms of information
Sort
View
CORR
2010
Springer
124views Education» more  CORR 2010»
15 years 6 months ago
Component Evolution in General Random Intersection Graphs
Abstract. Random intersection graphs (RIGs) are an important random structure with algorithmic applications in social networks, epidemic networks, blog readership, and wireless sen...
Milan Bradonjic, Aric A. Hagberg, Nicolas W. Henga...
ENTCS
2008
87views more  ENTCS 2008»
15 years 6 months ago
Integral of Fine Computable functions and Walsh Fourier series
We de ne the e ective integrability of Fine-computable functions and e ectivize some fundamental limit theorems in the theory of Lebesgue integral such as Bounded Convergence Theo...
Takakazu Mori, Mariko Yasugi, Yoshiki Tsujii
SIAMJO
2010
135views more  SIAMJO 2010»
15 years 4 months ago
On the Complexity of Selecting Disjunctions in Integer Programming
The imposition of general disjunctions of the form “πx ≤ π0 ∨ πx ≥ π0 + 1”, where π, π0 are integer valued, is a fundamental operation in both the branch-and-bound...
Ashutosh Mahajan, Ted K. Ralphs
ICSE
2009
IEEE-ACM
15 years 4 months ago
Reflecting on self-adaptive software systems
Self-adaptability has been proposed as an effective approach to automate the complexity associated with the management of modern-day software systems. While over the past decade w...
Jesper Andersson, Rogério de Lemos, Sam Mal...
MOC
2011
15 years 1 months ago
Fast evaluation of modular functions using Newton iterations and the AGM
We present an asymptotically fast algorithm for the numerical evaluation of modular functions such as the elliptic modular function j. Our algorithm makes use of the natural connec...
Régis Dupont