752 search results - page 67 / 151 » Faster approximation algorithms for the minimum latency prob... |
115
click to vote
ICCAD
1994
IEEE
15 years 7 months ago
1994
IEEE
We study a new placement problem: the reproducing placement problem (RPP). In each phase a module (or gate) is decomposed into two (or more) simpler modules. The goal is nd a \go...
150
click to vote
MOBIQUITOUS
2007
IEEE
15 years 9 months ago
2007
IEEE
— The dynamic nature of mobile ad hoc networks poses fundamental challenges to the design of service composition schemes that can minimize the effect of service disruptions. Alth...
149
click to vote
WIOPT
2005
IEEE
15 years 8 months ago
2005
IEEE
We consider the problem of transmission scheduling of data over a wireless fading channel with hard deadline constraints. Our system consists of N users, each with a fixed amount...
140
click to vote
WADS
2005
Springer
15 years 8 months ago
2005
Springer
An instance of the multi-radius cover problem consists of a graph G = (V, E) with edge lengths l : E → R+ . Each vertex u ∈ V represents a transmission station for which a tra...
120
click to vote
ECML
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Greedy machine learning algorithms suffer from shortsightedness, potentially returning suboptimal models due to limited exploration of the search space. Greedy search mis...