4913 search results - page 136 / 983 » Results and Perspectives of the G |
130
click to vote
ANSS
1999
IEEE
15 years 10 months ago
1999
IEEE
The results presented here are based on many years of experience of development and application of DYANA
139
click to vote
MSE
1999
IEEE
15 years 10 months ago
1999
IEEE
This paper summarizes the rationale behind revision of an electronic design automation course and the resulting learning objectives and course model. Early experiences are highlig...
136
click to vote
ARSCOM
1999
15 years 6 months ago
1999
For a given graph G, we fix s, and partition the vertex set into s classes, so that any given class contains few edges. The result gives a partition (U1,
197
click to vote
ISAAC
2009
Springer
16 years 1 months ago
2009
Springer
We present an algorithm that for any graph G and integer k ≥ 0 in time polynomial in the size of G either nds a spanning tree with at least k internal vertices, or outputs a ne...
182
click to vote
CP
2003
Springer
15 years 11 months ago
2003
Springer
This paper aims to show that Constraint Programming can be an efficient technique to solve a well-known combinatorial optimization problem: the search for a maximum clique in a gra...