1064 search results - page 36 / 213 » Exact Algorithms for the Quadratic Linear Ordering Problem |
126
click to vote
ASPDAC
2007
ACM
15 years 7 months ago
2007
ACM
Due to the extremely large sizes of power grids, IR drop analysis has become a computationally challenging problem both in terms of runtime and memory usage. It has been shown in [...
132
click to vote
EVOW
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. The quadratic assignment problem arises in a variety of practical settings. It is known to be among the hardest combinatorial problems for exact algorithms. Therefore, a ...
135
click to vote
ICGI
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We present an exact algorithm for identification of deterministic finite automata (DFA) which is based on satisfiability (SAT) solvers. Despite the size of the low level ...
137
click to vote
ICARCV
2008
IEEE
15 years 10 months ago
2008
IEEE
— We consider a discrete-time dynamical system with Boolean and continuous states, with the continuous state propagating linearly in the continuous and Boolean state variables, a...
116
click to vote
COCOON
2005
Springer
15 years 9 months ago
2005
Springer
In the well-studied Majority problem, we are given a set of n balls colored with two or more colors, and the goal is to use the minimum number of color comparisons to find a ball ...