5889 search results - page 783 / 1178 » Graph Layout Problems |
170
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
Credit institutions are seldom faced with problems dealing with single objectives. Often, decisions involving optimizing two or more competing goals simultaneously need to be made...
175
click to vote
ISCC
2005
IEEE
16 years 14 days ago
2005
IEEE
The problem of computing bandwidth guaranteed paths for given flow requests in an ad-hoc network is complicated because neighboring links share the medium. We define the path wi...
201
click to vote
IWPEC
2004
Springer
16 years 7 days ago
2004
Springer
The problem of packing k edge-disjoint triangles in a graph has been thoroughly studied both in the classical complexity and the approximation fields and it has a wide range of ap...
149
click to vote
MFCS
2004
Springer
16 years 7 days ago
2004
Springer
Abstract. We devise an efficient protocol by which a series of twoperson games Gi with unique winning strategies can be combined into a single game G with unique winning strategy, ...
168
click to vote
FUN
2010
Springer
15 years 11 months ago
2010
Springer
We consider a class of highly dynamic networks modelled on an urban subway system. We examine the problem of creating a map of such a subway in less than ideal conditions, where th...