4430 search results - page 119 / 886 » Solving Optimization Problems with DLL |
103
click to vote
EURODAC
1994
IEEE
15 years 7 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]...
152
click to vote
HEURISTICS
1998
15 years 2 months ago
1998
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
117
click to vote
WADS
2007
Springer
15 years 9 months ago
2007
Springer
In this paper, we give a O(log copt)-approximation algorithm for the point guard problem where copt is the optimal number of guards. Our algorithm runs in time polynomial in n, the...
115
click to vote
ISLPED
2003
ACM
15 years 8 months ago
2003
ACM
This paper proposes two very fast graph theoretic heuristics for the low power binding problem given fixed number of resources and multiple architectures for the resources. First...
128
click to vote
COCO
2000
Springer
15 years 7 months ago
2000
Springer
We show that the Shortest Path Problem cannot be solved in o(log n) time on an unbounded fan-in PRAM without bit operations using poly(n) processors even when the bit-lengths of t...