6740 search results - page 1036 / 1348 » An s -Hamiltonian Line Graph Problem |
232
Voted
WADS
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Portions of such codes when t...
194
click to vote
ISPD
2000
ACM
15 years 11 months ago
2000
ACM
modules can be handled in constraint graphs efficiently. This Floorplan area minimization is an important problem because many modules have shape flexibilities during the floorplan...
181
click to vote
KBSE
1995
IEEE
15 years 10 months ago
1995
IEEE
Numerical design optimization algorithms are highly sensitive to the particular formulation of the optimization problems they are given. The formulation of the search space, the o...
242
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Predicting the occurrence of links is a fundamental problem in networks. In the link prediction problem we are given a snapshot of a network and would like to infer which interact...
180
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract--In this paper, we investigate the use of messagepassing algorithms for the problem of finding the max-weight independent set (MWIS) in a graph. First, we study the perfor...