2434 search results - page 200 / 487 » Algorithmic Randomness of Closed Sets |
154
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
Orienteering is the following optimization problem: given an edge-weighted graph (directed or undirected), two nodes s, t and a time limit T, find an s-t walk of total length at ...
130
click to vote
COMBINATORICA
2007
15 years 3 months ago
2007
A complete partition of a graph G is a partition of its vertex set in which any two distinct classes are connected by an edge. Let cp(G) denote the maximum number of classes in a ...
133
Voted
JAIR
2007
15 years 4 months ago
2007
Solution-Guided Multi-Point Constructive Search (SGMPCS) is a novel constructive search technique that performs a series of resource-limited tree searches where each search begins...
140
click to vote
CIKM
1997
Springer
15 years 8 months ago
1997
Springer
This paper presents an efficient algorithm for learning Bayesian belief networks from databases. The algorithm takes a database as input and constructs the belief network structur...
157
click to vote
INFSOF
2008
15 years 3 months ago
2008
This paper introduces an approach to locating dependence structures in a program by searching the space of the powerset of the set of all possible program slices. The paper formul...