5214 search results - page 98 / 1043 » The Online Specialization Problem |
SODA
2010
ACM
14 years 6 months ago
2010
ACM
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...
EURODAC
1994
IEEE
14 years 1 months ago
1994
IEEE
We consider a switch module routing problem for symmetric array FPGAs. The work is motivated by two applications. The rst is that of eciently evaluating switch module designs [8]...
STACS
1994
Springer
14 years 1 months ago
1994
Springer
The complexity of the simple maxcut problem is investigated for several special classes of graphs. It is shown that this problem is NP-complete when restricted to one of the follo...
IPCO
2004
13 years 10 months ago
2004
We consider the problems of enumerating all minimal strongly connected subgraphs and all minimal dicuts of a given directed graph G = (V, E). We show that the first of these proble...
ECCC
2008
13 years 9 months ago
2008
We construct public-key cryptosystems that are secure assuming the worst-case hardness of approximating the minimum distance on n-dimensional lattices to within small poly(n) fact...