16091 search results - page 454 / 3219 » Solving |
183
click to vote
CACM
2010
15 years 7 months ago
2010
Static program analysis techniques cannot know certain values, such as the value of user input or network state, at analysis time. While such unknown values need to be treated as ...
185
click to vote
CGF
2010
15 years 7 months ago
2010
We present a closed-form solution for the symmetrization problem, solving for the optimal deformation that reconciles a set of local bilateral symmetries. Given as input a set of ...
161
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Programs to solve so-called constraint problems are complex pieces of software which require many design decisions to be made more or less arbitrarily by the implementer. These dec...
164
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
During our earlier research, it was recognised that in order to be successful with an indirect genetic algorithm approach using a decoder, the decoder has to strike a balance betw...
173
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc...