7840 search results - page 371 / 1568 » On generalized Ramsey numbers |
191
click to vote
FUN
2010
Springer
15 years 11 months ago
2010
Springer
In the classic Josephus problem, elements 1, 2, . . . , n are placed in order around a circle and a skip value k is chosen. The problem proceeds in n rounds, where each round consi...
171
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
The placement of regenerators in optical networks has become an active area of research during the last years. Given a set of lightpaths in a network G and a positive integer d, re...
163
click to vote
IPMU
2010
Springer
15 years 11 months ago
2010
Springer
We introduce a general definition for the independence of a number of finite-valued variables, based on coherent lower previsions. Our definition has an epistemic flavour: it a...
177
click to vote
INFOCOM
1999
IEEE
15 years 11 months ago
1999
IEEE
In general topology networks, routing from one node to another over a tree embedded in the network is intuitively a good strategy, since it typically results in a route length of O...
191
click to vote
ISTCS
1997
Springer
15 years 11 months ago
1997
Springer
We introduce the k-payment problem: given a total budget of N units, the problem is to represent this budget as a set of coins, so that any k exact payments of total value at most ...