4860 search results - page 255 / 972 » SNPs Problems, Complexity, and Algorithms |
111
click to vote
CONPAR
1992
15 years 4 months ago
1992
The algorithm designed in [12, 15] was the very first distributed algorithm to solve the mutual exclusion problem in complete networks by using a dynamic logical tree structure as...
124
click to vote
PODC
2010
ACM
15 years 2 months ago
2010
ACM
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
AI
2005
Springer
15 years 16 days ago
2005
Springer
One of the major approaches to approximation of logical theories is the upper and lower bounds approach introduced in (Selman and Kautz, 1991, 1996). In this paper, we address the...
167
click to vote
ISMIS
2011
Springer
14 years 3 months ago
2011
Springer
In the paper we present a new evolutionary algorithm for induction of regression trees. In contrast to the typical top-down approaches it globally searches for the best tree struct...
109
Voted
CORR
2007
Springer
15 years 18 days ago
2007
Springer
We consider the problem of estimating the parameters of a Gaussian or binary distribution in such a way that the resulting undirected graphical model is sparse. Our approach is to...