Sciweavers

1959 search results - page 112 / 392
» Concerned About Separation
Sort
View
JSAT
2007
63views more  JSAT 2007»
15 years 4 months ago
The Complexity of Some Subclasses of Minimal Unsatis able Formulas
This paper is concerned with the complexity of some natural subclasses of minimal unsatisfiable formulas. We show the DP –completeness of the classes of maximal and marginal mi...
Hans Kleine Büning, Xishun Zhao
AIR
2004
98views more  AIR 2004»
15 years 4 months ago
Further Experiments on Collaborative Ranking in Community-Based Web Search
As the search engine arms-race continues, search engines are constantly looking for ways to improve the manner in which they respond to user queries. Given the vagueness of Web sea...
Jill Freyne, Barry Smyth, Maurice Coyle, Evelyn Ba...
TC
1998
15 years 3 months ago
A Metaobject Architecture for Fault-Tolerant Distributed Systems: The FRIENDS Approach
—The FRIENDS system developed at LAAS-CNRS is a metalevel architecture providing libraries of metaobjects for fault tolerance, secure communication, and group-based distributed a...
Jean-Charles Fabre, Tanguy Pérennou
ISSRE
2010
IEEE
15 years 2 months ago
Detecting Dependences and Interactions in Feature-Oriented Design
—Feature-oriented software development (FOSD) aims at the construction, customization, and synthesis of large-scale software systems. We propose a novel software design paradigm,...
Sven Apel, Wolfgang Scholz, Christian Lengauer, Ch...
FSTTCS
2010
Springer
15 years 2 months ago
On extracting computations from propositional proofs (a survey)
This paper describes a project that aims at showing that propositional proofs of certain tautologies in weak proof system give upper bounds on the computational complexity of func...
Pavel Pudlák