Sciweavers

3495 search results - page 15 / 699
» On the random satisfiable process
Sort
View
RANDOM
1998
Springer
14 years 2 months ago
The "Burnside Process" Converges Slowly
Leslie Ann Goldberg, Mark Jerrum
ICN
2005
Springer
14 years 3 months ago
Maximizing System Value Among Interested Packets While Satisfying Time and Energy Constraints
: Data filtering is an important approach to reduce energy consumption. Following this idea, Interest is used as a constraint to filter uninterested data in sensor networks. Within...
Lei Shu, Sungyoung Lee, Xiaoling Wu, Jie Yang
AAAI
2006
13 years 11 months ago
Finding Maximally Satisfiable Terminologies for the Description Logic ALC
For ontologies represented as Description Logic Tboxes, optimised DL reasoners are able to detect logical errors, but there is comparatively limited support for resolving such pro...
Thomas Andreas Meyer, Kevin Lee, Richard Booth, Je...
ICALP
2009
Springer
14 years 5 months ago
A Better Algorithm for Random k-SAT
Let Φ be a uniformly distributed random k-SAT formula with n variables and m clauses. We present a polynomial time algorithm that finds a satisfying assignment of Φ with high p...
Amin Coja-Oghlan
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
14 years 2 months ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
Holger Dell and Dieter van Melkebeek