40 search results - page 3 / 8 » New bounds on a hypercube coloring problem |
EOR
2008
13 years 7 months ago
2008
This paper is a study of the car sequencing problem, when feature spacing constraints are soft and colors of vehicles are taken into account. Both pseudo-polynomial algorithms and ...
EUROCRYPT
2001
Springer
13 years 11 months ago
2001
Springer
Abstract. We consider the question of adaptive security for two related cryptographic primitives: all-or-nothing transforms and exposureresilient functions. Both are concerned with...
SPAA
1994
ACM
13 years 11 months ago
1994
ACM
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
DM
2007
13 years 7 months ago
2007
In this paper, we address the problem of λ labelings, that was introduced in the context of frequency assignment for telecommunication networks. In this model, stations within a ...
MFCS
2004
Springer
14 years 13 days ago
2004
Springer
We study the on-line versions of two fundamental graph problems, maximum independent set and minimum coloring, for the case of disk graphs which are graphs resulting from intersect...