12438 search results - page 337 / 2488 » The Magic of a Number System |
203
click to vote
STOC
1994
ACM
15 years 11 months ago
1994
ACM
We indicate strong non-approximability factors for central problems: N1/4 for Max Clique; N1/10 for Chromatic Number; and 66/65 for Max 3SAT. Underlying the Max Clique result is a...
201
click to vote
DLOG
2000
15 years 9 months ago
2000
In this contribution we present an empirical analysis of the performance of the ALCNHR+ description logic system RACE applied to TBoxes with a very large number of primitive conce...
177
click to vote
JDA
2008
15 years 7 months ago
2008
The Do-All problem is about scheduling t similar and independent tasks to be performed by p processors prone to crashes. We assume that the distributed system is synchronous with ...
177
click to vote
TWC
2008
15 years 7 months ago
2008
Scheduling in a broadcast channel based on partial channel-state-information at the transmitter is carried out in an opportunistic way. In this paper, the number of generated beams...
132
click to vote
COMBINATORICS
1998
15 years 7 months ago
1998
The number of noncrossing partitions of {1, 2, . . . , n} with fixed block sizes has a simple closed form, given by Kreweras, and coincides with the corresponding number for nonne...