Sciweavers

29908 search results - page 5896 / 5982
» On the complexity of communication complexity
Sort
View
SAT
2010
Springer
172views Hardware» more  SAT 2010»
13 years 8 months ago
On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
Denis Pankratov, Allan Borodin
SAT
2010
Springer
165views Hardware» more  SAT 2010»
13 years 8 months ago
An Empirical Study of Optimal Noise and Runtime Distributions in Local Search
This paper presents a detailed empirical study of local search for Boolean satisfiability (SAT), highlighting several interesting properties, some of which were previously unknown...
Lukas Kroc, Ashish Sabharwal, Bart Selman
SIAMSC
2010
142views more  SIAMSC 2010»
13 years 8 months ago
Nested Iteration and First-Order System Least Squares for Incompressible, Resistive Magnetohydrodynamics
This paper develops a nested iteration algorithm to solve time-dependent nonlinear systems of partial differential equations. For each time step, Newton’s method is used to form...
J. H. Adler, Thomas A. Manteuffel, Stephen F. McCo...
SIGMOD
2010
ACM
308views Database» more  SIGMOD 2010»
13 years 8 months ago
GBLENDER: towards blending visual query formulation and query processing in graph databases
Given a graph database D and a query graph g, an exact subgraph matching query asks for the set S of graphs in D that contain g as a subgraph. This type of queries find important...
Changjiu Jin, Sourav S. Bhowmick, Xiaokui Xiao, Ja...
SIGOPS
2010
162views more  SIGOPS 2010»
13 years 8 months ago
Visual and algorithmic tooling for system trace analysis: a case study
Despite advances in the application of automated statistical and machine learning techniques to system log and trace data there will always be a need for human analysis of machine...
Wim De Pauw, Steve Heisig
« Prev « First page 5896 / 5982 Last » Next »