18306 search results - page 383 / 3662 » Algorithmics in Exponential Time |
208
click to vote
ICCAD
1995
IEEE
15 years 11 months ago
1995
IEEE
The traditional algorithm of Stockmeyer for area minimization of slicing
oorplans has time (and space) complexity O(n2 ) in the worst case, or O(nlogn) for balanced slicing. For ...
161
click to vote
ESA
2009
Springer
16 years 2 months ago
2009
Springer
We consider online algorithms for pull-based broadcast scheduling. In this setting there are n pages of information at a server and requests for pages arrive online. When the serv...
221
click to vote
ECRTS
2007
IEEE
16 years 1 months ago
2007
IEEE
Since wireless ad-hoc networks use shared communication medium, accesses to the medium must be coordinated to avoid packet collisions. Transmission scheduling algorithms allocate ...
218
click to vote
ANSS
2000
IEEE
15 years 12 months ago
2000
IEEE
We present, in this paper, an algorithm which integrates flow control and dynamic load balancing in Time Warp. The algorithm is intended for use in a distributed memory environme...
185
click to vote
SWAT
2004
Springer
16 years 23 days ago
2004
Springer
In this paper, we consider the problems of generating all maximal (bipartite) cliques in a given (bipartite) graph G = (V, E) with n vertices and m edges. We propose two algorithms...