879 search results - page 135 / 176 » Optimizing for Reduced Code Space using Genetic Algorithms |
WWW
2010
ACM
15 years 9 months ago
2010
ACM
We present two modifications to the popular k-means clustering algorithm to address the extreme requirements for latency, scalability, and sparsity encountered in user-facing web...
DAC
2007
ACM
16 years 2 months ago
2007
ACM
In this paper, we propose TROY, the first track router with yield-driven wire planning to optimize yield loss due to random defects. As the probability of failure (POF) computed f...
124
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...
126
click to vote
CODES
2003
IEEE
15 years 7 months ago
2003
IEEE
the level of abstraction in system design promises to enable faster exploration of the design space at early stages. While scheduling decision for embedded software has great impa...
120
click to vote
ICML
2006
IEEE
16 years 2 months ago
2006
IEEE
If appropriately used, prior knowledge can significantly improve the predictive accuracy of learning algorithms or reduce the amount of training data needed. In this paper we intr...