5473 search results - page 710 / 1095 » On the graph isomorphism problem |
175
Voted
ILP
2000
Springer
15 years 10 months ago
2000
Springer
Induction of recursive theories in the normal ILP setting is a complex task because of the non-monotonicity of the consistency property. In this paper we propose computational solu...
171
click to vote
DAC
1995
ACM
15 years 10 months ago
1995
ACM
This paper describes a technique for calculating the switching activity of a set of registers shared by di erent data values. Based on the assumption that the joint pdf (probabili...
178
click to vote
WADS
1995
Springer
15 years 10 months ago
1995
Springer
We consider the problem of obtaining “nice” quadrangulations of planar sets of points. For many applications “nice” means that the quadrilaterals obtained are convex if po...
164
click to vote
ASPDAC
2008
ACM
15 years 8 months ago
2008
ACM
A two-stage optimization methodology is proposed to solve the fixed-outline floorplanning problem that is a global optimization problem for wirelength minimization. In the first st...
170
click to vote
IPCO
2001
15 years 8 months ago
2001
Garg [10] gives two approximation algorithms for the minimum-cost tree spanning k vertices in an undirected graph. Recently Jain and Vazirani [16] discovered primal-dual approxima...