Sciweavers

7055 search results - page 1113 / 1411
» Some New 4-Designs
Sort
View
IJMSO
2006
105views more  IJMSO 2006»
15 years 7 months ago
A framework for context-sensitive metadata description
Recent expectations regarding the new generation of Web strongly depend on the success of Semantic Web technology. Resource Description Framework (RDF) is a basis for an explicit a...
Oleksiy Khriyenko, Vagan Y. Terziyan
CONSTRAINTS
2007
122views more  CONSTRAINTS 2007»
15 years 7 months ago
Stochastic Local Search Algorithms for Graph Set T -colouring and Frequency Assignment
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
Marco Chiarandini, Thomas Stützle
JACM
2008
90views more  JACM 2008»
15 years 7 months ago
Bit complexity of breaking and achieving symmetry in chains and rings
We consider a failure-free, asynchronous message passing network with n links, where the processors are arranged on a ring or a chain. The processors are identically programmed bu...
Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum
193
Voted
CORR
2007
Springer
125views Education» more  CORR 2007»
15 years 7 months ago
Gaussian Interference Channel Capacity to Within One Bit
—The capacity of the two-user Gaussian interference channel has been open for 30 years. The understanding on this problem has been limited. The best known achievable region is du...
Raul Etkin, David Tse, Hua Wang
CORR
2007
Springer
52views Education» more  CORR 2007»
15 years 7 months ago
Hierarchical Unambiguity
Abstract. We develop techniques to investigate relativized hierarchical unambiguous computation. We apply our techniques to push forward some known constructs involving relativized...
Holger Spakowski, Rahul Tripathi
« Prev « First page 1113 / 1411 Last » Next »