4372 search results - page 228 / 875 » Algorithmic Theories of Everything |
293
click to vote
COMPGEOM
2011
ACM
14 years 9 months ago
2011
ACM
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
200
click to vote
CADE
2007
Springer
16 years 6 months ago
2007
Springer
Manna and Pnueli have extensively shown how a mixture of first-order logic (FOL) and discrete Linear time Temporal Logic (LTL) is sufficient to precisely state verification problem...
134
click to vote
ICPP
2008
IEEE
16 years 8 days ago
2008
IEEE
Strategies are developed for “fattening” the tasks of computation-dags so as to accommodate the heterogeneity of remote clients in Internet-based computing (IC). Earlier work ...
150
click to vote
ICDCS
2006
IEEE
15 years 12 months ago
2006
IEEE
Earlier work has developed the underpinnings of a theory of scheduling computations having intertask dependencies—modeled via dags—for Internet-based computing. The goal of th...
119
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
We propose a new methodology to look at the fitness contributions (semantics) of different schemata in Genetic Programming (GP). We hypothesize that the significance of a schem...