407 search results - page 76 / 82 » Recursive or iterative routing |
123
click to vote
KDD
2005
ACM
15 years 6 months ago
2005
ACM
We present a probabilistic model-based framework for distributed learning that takes into account privacy restrictions and is applicable to scenarios where the different sites ha...
110
Voted
CHARME
2003
Springer
15 years 6 months ago
2003
Springer
This paper shows how classic inductive assertions can be used in conjunction with an operational semantics to prove partial correctness properties of programs. The method imposes o...
119
Voted
FOCS
2000
IEEE
15 years 5 months ago
2000
IEEE
Extractors (defined by Nisan and Zuckerman) are procedures that use a small number of truly random bits (called the seed) to extract many (almost) truly random bits from arbitrar...
GECCO
2006
Springer
15 years 4 months ago
2006
Springer
The most popular approaches for reconstructing phylogenetic trees attempt to solve NP-hard optimization criteria such as maximum parsimony (MP). Currently, the bestperforming heur...
137
click to vote
IJCAI
1997
15 years 2 months ago
1997
As an alternative to planning, an approach to highlevel agent control based on concurrent program execution is considered. A formal definition in the situation calculus of such a ...