Sciweavers

925 search results - page 66 / 185
» A Solution to the Extended GCD Problem
Sort
View
INFOCOM
2003
IEEE
14 years 2 months ago
Optimal Partition of QoS Requirements for Many-to-Many Connections
— We study problems related to supporting multicast connections with Quality of Service (QoS) requirements. We investigate the problem of optimal resource allocation in the conte...
Dean H. Lorenz, Ariel Orda, Danny Raz
DATE
2009
IEEE
95views Hardware» more  DATE 2009»
14 years 3 months ago
Minimization of NBTI performance degradation using internal node control
—Negative Bias Temperature Instability (NBTI) is a significant reliability concern for nanoscale CMOS circuits. Its effects on circuit timing can be especially pronounced for ci...
David R. Bild, Gregory E. Bok, Robert P. Dick
FLAIRS
2003
13 years 10 months ago
Dispatching Cases versus Merging Case-Bases: When MCBR Matters
Multi-case-base reasoning (MCBR) extends case-based reasoning to draw on multiple case bases that may address somewhat different tasks. In MCBR, an agent selectively supplements i...
David B. Leake, Raja Sooriamurthi
CORR
2010
Springer
98views Education» more  CORR 2010»
13 years 8 months ago
Structure-Aware Stochastic Control for Transmission Scheduling
In this report, we consider the problem of real-time transmission scheduling over time-varying channels. We first formulate the transmission scheduling problem as a Markov decisio...
Fangwen Fu, Mihaela van der Schaar
PKDD
2009
Springer
147views Data Mining» more  PKDD 2009»
14 years 3 months ago
Kernel Polytope Faces Pursuit
Abstract. Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by 1 regularised least-squares (Lasso) [4,10] in a similar vein to (Or...
Tom Diethe, Zakria Hussain