1552 search results - page 221 / 311 » On the Complexity of Constant Propagation |
182
click to vote
ICRA
2007
IEEE
16 years 23 days ago
2007
IEEE
— We explore an on-line problem where a group of robots has to reach a target whose position is known in an unknown planar environment whose geometry is acquired by the robots du...
189
click to vote
ASIACRYPT
2007
Springer
16 years 19 days ago
2007
Springer
We show that computing e-th roots modulo n is easier than factoring n with currently known methods, given subexponential access to an oracle outputting the roots of numbers of the ...
156
click to vote
SPAA
2006
ACM
16 years 12 days ago
2006
ACM
The problem of scalable and robust distributed data storage has recently attracted a lot of attention. A common approach in the area of peer-to-peer systems has been to use a dist...
158
click to vote
INFOCOM
2003
IEEE
15 years 11 months ago
2003
IEEE
— In this paper, we propose two schemes for the load balanced Birkhoff-von Neumann switches to provide guaranteed rate services. As in [7], the first scheme is based on an Earli...
209
click to vote
TPHOL
1999
IEEE
15 years 10 months ago
1999
IEEE
Abstract. We describe the key features of the proof description language of Declare, an experimental theorem prover for higher order logic. We take a somewhat radical approach to p...