Sciweavers

628 search results - page 79 / 126
» The minimum shift design problem
Sort
View
ESA
2005
Springer
176views Algorithms» more  ESA 2005»
14 years 2 months ago
On Degree Constrained Shortest Paths
Abstract. Traditional shortest path problems play a central role in both the design and use of communication networks and have been studied extensively. In this work, we consider a...
Samir Khuller, Kwangil Lee, Mark A. Shayman
DAC
2004
ACM
14 years 9 months ago
Profile-based optimal intra-task voltage scheduling for hard real-time applications
This paper presents a set of comprehensive techniques for the intratask voltage scheduling problem to reduce energy consumption in hard real-time tasks of embedded systems. Based ...
Jaewon Seo, Taewhan Kim, Ki-Seok Chung
IWCMC
2009
ACM
14 years 3 months ago
Optimal cooperative spectrum sensing in cognitive sensor networks
This paper addresses the problem of optimal cooperative spectrum sensing in a cognitive-enabled sensor network where cognitive sensors can cooperate in the sensing of the spectrum...
Hai Ngoc Pham, Yan Zhang, Paal E. Engelstad, Tor S...
COMSWARE
2007
IEEE
14 years 2 months ago
Survivable Routing in WDM Weighted Networks
: In this paper, we investigate the problem of routing lightpaths on an arbitrary physical topology following a Design Protection approach, such that virtual topology remains conne...
Debasis Mandal, Satyajit Nath, Bivas Mitra
ICCAD
1997
IEEE
129views Hardware» more  ICCAD 1997»
14 years 22 days ago
A fast and robust exact algorithm for face embedding
We present a new matrix formulation of the face hypercube embedding problem that motivates the design of an efficient search strategy to find an encoding that satisfies all fac...
Evguenii I. Goldberg, Tiziano Villa, Robert K. Bra...