1308 search results - page 232 / 262 » Let's Have a Conversation |
164
click to vote
JCT
1998
15 years 5 months ago
1998
Let Q(N) denote the number of partitions of N into distinct parts. If ω(k) := 3k2 +k 2 , then it is well known that Q(N) + ∞X k=1 (−1)k “ Q(N − 2ω(k)) + Q(N − 2ω(−k)...
157
click to vote
JUCS
2002
15 years 5 months ago
2002
Abstract: Two of today's most used buzz-words in the context of software development are the terms Componentware and Distributed Object-System. The combination of both ideas i...
154
click to vote
TIT
2002
15 years 5 months ago
2002
The problem of optimal sequential decision for individual sequences, relative to a class of competing o -line reference strategies, is studied for general loss functions with memo...
196
click to vote
CP
2010
Springer
15 years 4 months ago
2010
Springer
We present a new complete multi-valued SAT solver, based on current state-of-the-art SAT technology. It features watched literal propagation and conflict driven clause learning. W...
182
click to vote
JCT
2010
15 years 4 months ago
2010
Abstract. A weighting of the edges of a graph is called vertexcoloring if the weighted degrees of the vertices yield a proper coloring of the graph. In this paper we show that such...