4698 search results - page 13 / 940 » Making Functionality More General |
129
click to vote
SIAMCOMP
2010
14 years 9 months ago
2010
In the first part of the paper, we reexamine the all-pairs shortest paths (APSP) problem and present a new algorithm with running time O(n3 log3 log n/ log2 n), which improves all...
110
click to vote
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
With resemblance of finite-state machines to some biological mechanisms in cells and numerous applications of finite automata in different fields, this paper uses analogies an...
140
Voted
LION
2007
Springer
15 years 8 months ago
2007
Springer
The importance of tuning a search algorithm for the specific features of the target search space has been known for quite some time. However, when dealing with multiobjective prob...
144
click to vote
DAIS
2003
15 years 3 months ago
2003
Abstract. It is generally agreed that one of the key services of componentbased systems are transactions. However, an agreement on how components should be involved in transactions...
113
Voted
JMLR
2006
15 years 2 months ago
2006
We describe an approach to the inductive synthesis of recursive equations from input/outputexamples which is based on the classical two-step approach to induction of functional Li...