Sciweavers

4103 search results - page 178 / 821
» Some results on the Collatz problem
Sort
View
ENTCS
2002
73views more  ENTCS 2002»
15 years 6 months ago
Reducing the Overhead of Dynamic Analysis
Dynamic analysis (instrumenting programs with code to detect and prevent errors during program execution) can be an effective approach to debugging, as well as an effective means ...
Suan Hsi Yong, Susan Horwitz
JAL
1998
74views more  JAL 1998»
15 years 6 months ago
A Survey of Fast Exponentiation Methods
Public-key cryptographic systems often involve raising elements of some group (e.g. GF(2n), Z/NZ, or elliptic curves) to large powers. An important question is how fast this expon...
Daniel M. Gordon
RAS
2002
112views more  RAS 2002»
15 years 6 months ago
Avoiding self-occlusions and preserving visibility by path planning in the image
In this paper, we address the problem of generating trajectories of some image features in order to control efficiently a robotic system using an image-based control strategy. Firs...
Youcef Mezouar, François Chaumette
SIGMETRICS
2002
ACM
161views Hardware» more  SIGMETRICS 2002»
15 years 6 months ago
Performance study of dispatching algorithms in multi-tier web architectures
The number and heterogeneity of requests to Web sites are increasing also because the Web technology is becoming the preferred interface for information systems. Many systems host...
Mauro Andreolini, Michele Colajanni, Ruggero Morse...
MP
2007
89views more  MP 2007»
15 years 6 months ago
Globally convergent limited memory bundle method for large-scale nonsmooth optimization
Many practical optimization problems involve nonsmooth (that is, not necessarily differentiable) functions of thousands of variables. In the paper [Haarala, Miettinen, M¨akel¨a,...
Napsu Haarala, Kaisa Miettinen, Marko M. Mäke...