3204 search results - page 438 / 641 » The Alcuin Number of a Graph |
216
click to vote
STOC
2010
ACM
15 years 11 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
154
click to vote
ICCAD
1996
IEEE
15 years 11 months ago
1996
IEEE
The functional validation of a state-of-the-art digital design is usually performed by simulation of a register-transfer-level model. The degree to which the testvector suite cove...
180
click to vote
SIGCOMM
1992
ACM
15 years 11 months ago
1992
ACM
With the emergence of large switched public data networks that are well-suited to connectionless internets, for instance SMDS, it is possible that larger and larger numbers of int...
187
click to vote
COCOON
2006
Springer
15 years 10 months ago
2006
Springer
Many real-life scheduling, routing and location problems can be formulated as combinatorial optimization problems whose goal is to find a linear layout of an input graph in such a ...
193
click to vote
APPROX
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstruc...