4865 search results - page 666 / 973 » The Complexity of Graph Connectivity |
135
click to vote
ACTA
2006
15 years 5 months ago
2006
Abstract Selectivity estimation of a boolean query based on frequent itemsets can be solved by describing the problem by a linear program. However, the number of variables in the e...
188
Voted
AI
2006
Springer
15 years 5 months ago
2006
Springer
This article presents and analyzes algorithms that systematically generate random Bayesian networks of varying difficulty levels, with respect to inference using tree clustering. ...
120
click to vote
IANDC
2006
15 years 5 months ago
2006
This paper generalizes existing connections between automata and logic to a coalgestraction level. Let F : Set Set be a standard functor that preserves weak pullbacks. We introdu...
132
Voted
CORR
2007
Springer
15 years 5 months ago
2007
Springer
— We are given an equal number of mobile robotic agents, and distinct target locations. Each agent has simple integrator dynamics, a limited communication range, and knowledge of...
188
Voted
CORR
2007
Springer
15 years 5 months ago
2007
Springer
—In a sensor network, in practice, the communication among sensors is subject to: 1) errors that can cause failures of links among sensors at random times; 2) costs; and 3) const...