Sciweavers

2926 search results - page 104 / 586
» Partially Optimal Routing
Sort
View
107
Voted
KDD
2009
ACM
173views Data Mining» more  KDD 2009»
16 years 1 months ago
The offset tree for learning with partial labels
We present an algorithm, called the offset tree, for learning in situations where a loss associated with different decisions is not known, but was randomly probed. The algorithm i...
Alina Beygelzimer, John Langford
84
Voted
PARCO
2003
15 years 2 months ago
SIMD design to solve partial differential equations
The relation between autonomous and communication phases determines the throughput of parallel structured information processing systems. Such a relation depends on the algorithm w...
R. W. Schulze
TCBB
2010
137views more  TCBB 2010»
14 years 7 months ago
The Metropolized Partial Importance Sampling MCMC Mixes Slowly on Minimum Reversal Rearrangement Paths
Markov chain Monte Carlo has been the standard technique for inferring the posterior distribution of genome rearrangement scenarios under a Bayesian approach. We present here a neg...
István Miklós, Bence Melykuti, Krist...
ICCAD
1997
IEEE
91views Hardware» more  ICCAD 1997»
15 years 5 months ago
Interconnect layout optimization under higher-order RLC model
In this paper, we study the interconnect layout optimization problem under a higher-order RLC model to optimize not just delay, but also waveform for RLC circuits with non-monoton...
Jason Cong, Cheng-Kok Koh
111
Voted
NETWORKING
2004
15 years 2 months ago
Power Adaptation Based Optimization for Energy Efficient Reliable Wireless Paths
We define a transmission power adaptation-based routing technique that finds optimal paths for minimum energy reliable data transfer in multi-hop wireless networks. This optimal ch...
Suman Banerjee, Archan Misra