4565 search results - page 687 / 913 » Time Optimal Self-Stabilizing Algorithms |
139
click to vote
LICS
1997
IEEE
15 years 5 months ago
1997
IEEE
A subtyping 0 is entailed by a set of subtyping constraints C, written C j= 0, if every valuation (mapping of type variables to ground types) that satisfies C also satisfies 0. ...
99
Voted
WSC
2008
15 years 3 months ago
2008
This research endeavor focused on the warehouse receiving process at a large food distribution center, which comprises of trucks with goods reaching the destination warehouse, unl...
113
Voted
NIPS
2007
15 years 2 months ago
2007
Planning in partially observable environments remains a challenging problem, despite significant recent advances in offline approximation techniques. A few online methods have a...
86
Voted
UAI
2003
15 years 2 months ago
2003
The paper studies empirically the time-space trade-off between sampling and inference in the cutset sampling algorithm. The algorithm samples over a subset of nodes in a Bayesian ...
ESA
2010
Springer
15 years 1 months ago
2010
Springer
Text search engines return a set of k documents ranked by similarity to a query. Typically, documents and queries are drawn from natural language text, which can readily be partiti...