2766 search results - page 178 / 554 » Algorithms for trigonometric polynomials |
170
click to vote
ICC
2007
IEEE
16 years 23 days ago
2007
IEEE
— Multi-slot resource scheduling in a general two dimensional wireless ad hoc network, is a hard problem with no known polynomial-time solution. Recent optimization theoretic ana...
150
click to vote
ISCAS
2005
IEEE
16 years 19 hour ago
2005
IEEE
In high-level synthesis, accurate lower-bound estimation is helpful to explore the search space efficiently and to evaluate the quality of heuristic algorithms. For the lower-bound...
151
click to vote
SWAT
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We study the gossiping problem in directed ad-hoc radio networks. Our main result is a deterministic algorithm that solves this problem in an n-node network in time O(n4/...
148
click to vote
STOC
1998
ACM
15 years 10 months ago
1998
ACM
We introduce and study a modi ed notion of planarity, in which two regions of a map are considered adjacent when they share any point of their boundaries not an edge, as standard...
195
click to vote
ESA
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We consider the problem of finding shortest paths in a graph with independent randomly distributed edge lengths. Our goal is to maximize the probability that the path len...