Sciweavers

5138 search results - page 592 / 1028
» Randomized Algorithms for 3-SAT
Sort
View
GECCO
2007
Springer
155views Optimization» more  GECCO 2007»
16 years 29 days ago
Solving the MAXSAT problem using a multivariate EDA based on Markov networks
Markov Networks (also known as Markov Random Fields) have been proposed as a new approach to probabilistic modelling in Estimation of Distribution Algorithms (EDAs). An EDA employ...
Alexander E. I. Brownlee, John A. W. McCall, Deryc...
ISSAC
2007
Springer
153views Mathematics» more  ISSAC 2007»
16 years 29 days ago
On exact and approximate interpolation of sparse rational functions
The black box algorithm for separating the numerator from the denominator of a multivariate rational function can be combined with sparse multivariate polynomial interpolation alg...
Erich Kaltofen, Zhengfeng Yang
ICPP
2005
IEEE
16 years 12 days ago
Push-Pull: Guided Search DAG Scheduling for Heterogeneous Clusters
Consider a heterogeneous cluster system, consisting of processors with varying processing capabilities and network links with varying bandwidths. Given a DAG application to be sch...
Sang Cheol Kim, Sunggu Lee
ISSAC
2005
Springer
105views Mathematics» more  ISSAC 2005»
16 years 9 days ago
Computing the rank and a small nullspace basis of a polynomial matrix
We reduce the problem of computing the rank and a nullspace basis of a univariate polynomial matrix to polynomial matrix multiplication. For an input n×n matrix of degree d over ...
Arne Storjohann, Gilles Villard
STACS
2005
Springer
16 years 9 days ago
Solving Medium-Density Subset Sum Problems in Expected Polynomial Time
The subset sum problem (SSP) (given n numbers and a target bound B, find a subset of the numbers summing to B), is one of the classical NP-hard problems. The hardness of SSP vari...
Abraham Flaxman, Bartosz Przydatek