2957 search results - page 347 / 592 » The Complexity of Polynomial-Time Approximation |
174
click to vote
STOC
2006
ACM
16 years 16 days ago
2006
ACM
We show that for any constant ε > 0, there is no Ω(log1−ε M)approximation algorithm for the directed congestion minimization problem on networks of size M unless NP ⊆ Z...
170
click to vote
ICRA
2005
IEEE
16 years 5 days ago
2005
IEEE
Abstract— We present a novel algorithm for motion planning of a deformable robot in a static environment. Given the initial and final configuration of the robot, our algorithm ...
153
click to vote
ISCAS
2005
IEEE
16 years 5 days ago
2005
IEEE
— Based on a Fourier series analysis, an analytic interconnect model is presented which is suitable for periodic signals, such as a clock signal. In this model, the far end time ...
195
click to vote
FSE
2005
Springer
16 years 3 days ago
2005
Springer
In this paper we present a distinguisher targeting towards irregularly clocked filter generators. The attack is applied on the irregularly clocked stream cipher called LILI-II. LI...
179
click to vote
ATAL
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Control for agents situated in multi-agent systems is a complex problem. This is particularly true in hard, open, dynamic environments where resource, privacy, bandwidth,...