1082 search results - page 100 / 217 » Stability of Locally Optimal Solutions |
156
click to vote
LCPC
2000
Springer
15 years 9 months ago
2000
Springer
In translating HPF programs, a compiler has to generate local iteration and communication sets. Apart from local enumeration, local storage compression is an issue, because in HPF ...
136
Voted
GECCO
2004
Springer
15 years 11 months ago
2004
Springer
Traditionally, the mutation rates of genetic algorithms are fixed or decrease over the generations. Although it seems to be reasonable for classical genetic algorithms, it may not...
156
Voted
XSYM
2004
Springer
15 years 11 months ago
2004
Springer
A key step in the optimization of declarative queries over XML data is estimating the selectivity of path expressions, i.e., the number of elements reached by a specific navigatio...
175
click to vote
PRICAI
2004
Springer
15 years 11 months ago
2004
Springer
Temporal reasoning is an important task in many areas of computer science including planning, scheduling, temporal databases and instruction optimisation for compilers. Given a kno...
186
click to vote
DCOSS
2011
Springer
14 years 6 months ago
2011
Springer
—In many application scenarios sensors need to calculate the average of some local values, e.g. of local measurements. A possible solution is to rely on consensus algorithms. In ...