6740 search results - page 1030 / 1348 » An s -Hamiltonian Line Graph Problem |
181
click to vote
ICCAD
2000
IEEE
15 years 11 months ago
2000
IEEE
–An FPGA switch box is said to be hyper-universal if it is routable for all possible surrounding multi-pin net topologies satisfying the routing resource constraints. It is desir...
201
click to vote
ISSS
2000
IEEE
15 years 11 months ago
2000
IEEE
This paper addresses the problem of estimating lower bounds on the power consumption in scheduled data flow graphs with a fixed number of allocated resources prior to binding. T...
140
click to vote
ICDCS
2010
IEEE
15 years 10 months ago
2010
IEEE
Abstract—Overlay network design for topic-based publish/subscribe systems is of primary importance because the overlay directly impacts the system’s performance. Determining a ...
204
click to vote
DCOSS
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. We consider the problem of estimating the locations of mobile agents by fusing the measurements of displacements of the agents as well as relative position measurements b...
157
click to vote
ASPDAC
2008
ACM
15 years 8 months ago
2008
ACM
In this paper we present a mathematical programming formulation of the integer time budgeting problem for directed acyclic graphs. In particular, we formally prove that our constr...