Sciweavers

1511 search results - page 106 / 303
» Randomness, lowness and degrees
Sort
View
ICPPW
2003
IEEE
15 years 11 months ago
Constructing Nondominated Local Coteries for Distributed Resource Allocation
The resource allocation problem is a fundamental problem in distributed systems. In this paper, we focus on constructing nondominated (ND) local coteries to solve the problem. Dis...
Jehn-Ruey Jiang, Cheng-Sheng Chou, Shing-Tsaan Hua...
COCO
2009
Springer
96views Algorithms» more  COCO 2009»
15 years 10 months ago
On the Complexity of Boolean Functions in Different Characteristics
Every Boolean function on n variables can be expressed as a unique multivariate polynomial modulo p for every prime p. In this work, we study how the degree of a function in one c...
Parikshit Gopalan, Shachar Lovett, Amir Shpilka
NETWORKING
2007
15 years 7 months ago
Graph Based Modeling of P2P Streaming Systems
This paper addresses the study of fundamental properties of stream-based content distribution services. We assume the presence of an overlay network with limited connectivity degre...
Damiano Carra, Renato Lo Cigno, Ernst W. Biersack
CAD
2008
Springer
15 years 6 months ago
Approximate computation of curves on B-spline surfaces
Curves on surfaces play an important role in computer-aided geometric design. Because of the considerably high degree of exact curves on surfaces, approximation algorithms are pre...
Yi-Jun Yang, Song Cao, Jun-Hai Yong, Hui Zhang, Je...
APAL
1998
71views more  APAL 1998»
15 years 6 months ago
Splitting Theorems and the Jump Operator
We investigate the relationship of (jumps of) the degrees of splittings of a computably enumerable set and the degree of the set. We prove that there is a high computably enumerab...
Rodney G. Downey, Richard A. Shore