Sciweavers

4103 search results - page 278 / 821
» Some results on the Collatz problem
Sort
View
SIGACT
2008
103views more  SIGACT 2008»
15 years 6 months ago
Computational geometry column 50
Two long-open problems have been solved: (1) every sufficiently large planar point set in general position contains the vertices of an empty hexagon; (2) every finite collection o...
Joseph O'Rourke
TEC
2008
91views more  TEC 2008»
15 years 6 months ago
Applying a Traffic Lights Evolutionary Optimization Technique to a Real Case: "Las Ramblas" Area in Santa Cruz de Tenerife
Abstract--In previous research, we have designed and successfully tested a Traffic Light Cycles Evolutionary Optimization Architecture. In this paper, we attempt to validate those ...
Javier J. Sánchez Medina, Manuel J. Gal&aac...
ANOR
2002
100views more  ANOR 2002»
15 years 6 months ago
A Limited-Memory Multipoint Symmetric Secant Method for Bound Constrained Optimization
A new algorithm for solving smooth large-scale minimization problems with bound constraints is introduced. The way of dealing with active constraints is similar to the one used in...
Oleg P. Burdakov, José Mario Martíne...
153
Voted
CORR
2004
Springer
111views Education» more  CORR 2004»
15 years 6 months ago
Distance distribution of binary codes and the error probability of decoding
We address the problem of bounding below the probability of error under maximum-likelihood decoding of a binary code with a known distance distribution used on a binarysymmetric ch...
Alexander Barg, Andrew McGregor
SIGMOD
2005
ACM
133views Database» more  SIGMOD 2005»
16 years 7 months ago
Constrained Optimalities in Query Personalization
Personalization is a powerful mechanism that helps users to cope with the abundance of information on the Web. Database query personalization achieves this by dynamically construc...
Georgia Koutrika, Yannis E. Ioannidis