222 search results - page 5 / 45 » Symmetry and Search in a Network Design Problem |
104
click to vote
PPSN
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
106
click to vote
ANTSW
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. In this paper, a Cooperative Network Game (CNG) is introduced. In this game, all players have the same goal: display a video content in real time, with no cuts and low bu...
ANOR
2007
14 years 11 months ago
2007
The min-SHIFT DESIGN problem (MSD) is an important scheduling problem that needs to be solved in many industrial contexts. The issue is to find a minimum number of shifts and the...
IJNSEC
2008
14 years 11 months ago
2008
This paper concerns the problem of reducing the implementation cost of the switchable data-dependent operations (SDDOs) that are a new cryptographic primitive oriented to the desi...
108
click to vote
EVOW
2009
Springer
15 years 4 months ago
2009
Springer
This paper deals with the generation of balanced incomplete block designs (BIBD), a hard constrained combinatorial problem with multiple applications. This problem is here formulat...