6740 search results - page 372 / 1348 » An s -Hamiltonian Line Graph Problem |
139
click to vote
ECAI
2010
Springer
15 years 5 months ago
2010
Springer
Landmarks for a planning problem are subgoals that are necessarily made true at some point in the execution of any plan. Since verifying that a fact is a landmark is PSPACE-complet...
110
click to vote
ISCAS
2003
IEEE
2003
IEEE
Bifurcation analysis of a power-factor-correction boost converter: uncovering fast-scale instability
15 years 10 months ago
Bifurcation analysis is performed to a power-factor-correction (PFC) boost converter to examine the fast-scale instability problem. Computer simulations and analysis reveal the po...
132
Voted
JUCS
2007
15 years 4 months ago
2007
: In this paper, we study spectral versions of the densest subgraph problem and the largest independence subset problem. In the first part, we give an algorithm for identifying sm...
134
click to vote
DAC
1999
ACM
16 years 5 months ago
1999
ACM
Finding the minimum column multiplicity for a bound set of variables is an important problem in Curtis decomposition. To investigate this problem, we compared two graphcoloring pr...
139
Voted
ICML
2006
IEEE
16 years 5 months ago
2006
IEEE
Recently there has been considerable interest in learning with higher order relations (i.e., three-way or higher) in the unsupervised and semi-supervised settings. Hypergraphs and...