1157 search results - page 174 / 232 » Solving iterated functions using genetic programming |
88
Voted
EMNLP
2008
15 years 5 months ago
2008
We introduce a method for solving substitution ciphers using low-order letter n-gram models. This method enforces global constraints using integer programming, and it guarantees t...
143
Voted
MOBIHOC
2006
ACM
16 years 3 months ago
2006
ACM
Localization is an important and extensively studied problem in ad-hoc wireless sensor networks. Given the connectivity graph of the sensor nodes, along with additional local info...
137
Voted
EMSOFT
2004
Springer
15 years 9 months ago
2004
Springer
We present a technique to approximate the worst-case execution time that combines structural analysis with a loop-bounding algorithm based on local induction variable analysis. St...
143
Voted
NIPS
1996
15 years 4 months ago
1996
Dynamic Programming, Q-learning and other discrete Markov Decision Process solvers can be applied to continuous d-dimensional state-spaces by quantizing the state space into an arr...
116
click to vote
GRAPHICSINTERFACE
2007
15 years 5 months ago
2007
Material limitations and fabrication costs generally run at odds with the creativity of architectural design, producing a wealth of challenging computational geometry problems. We...