280 search results - page 12 / 56 » New Algorithms for Enumerating All Maximal Cliques |
EOR
2007
14 years 9 months ago
2007
The Pallet Loading Problem (PLP) maximizes the number of identical rectangular boxes placed within a rectangular pallet. Boxes may be rotated 90° so long as they are packed with ...
84
Voted
ISCC
2003
IEEE
15 years 2 months ago
2003
IEEE
In this paper, we propose new pipelined request-grant-accept (RGA) and request-grant (RG) maximal size matching (MSM) algorithms to achieve speedup in combined input and output qu...
ICCAD
1997
IEEE
15 years 1 months ago
1997
IEEE
Traditional minimum area retiming algorithms attempt to achieve their prescribed objective with no regard to maintaining the initial state of the system. This issue is important f...
STOC
2005
ACM
15 years 9 months ago
2005
ACM
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...
SAT
2005
Springer
15 years 2 months ago
2005
Springer
Much attention has been given in recent years to the problem of finding Minimally Unsatisfiable Subformulas (MUSes) of Boolean formulas. In this paper, we present a new view of the...