Sciweavers

2412 search results - page 57 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
JSAT
2007
63views more  JSAT 2007»
13 years 9 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
BMEI
2008
IEEE
14 years 4 months ago
A New Approach for Tree Alignment Based on Local Re-Optimization
Multiple sequence alignment is the most fundamental task in bioinformatics and computational biology. In this paper, we present a new algorithm to conduct multiple sequences align...
Feng Yue, Jijun Tang
ISTA
2004
13 years 11 months ago
Combining the Best of Global-as-View and Local-as-View for Data Integration
Currently, there are two main basic approaches to data integration: Global-as-View (GaV) and Local-as-View (LaV). However, both GaV and LaV have their limitations. In a GaV approa...
Li Xu, David W. Embley
FSTTCS
2009
Springer
14 years 4 months ago
Modelchecking counting properties of 1-safe nets with buffers in paraPSPACE
ABSTRACT. We consider concurrent systems that can be modelled as 1-safe Petri nets communicating through a fixed set of buffers (modelled as unbounded places). We identify a param...
M. Praveen, Kamal Lodaya
AAAI
2008
14 years 8 days ago
Hybrid Markov Logic Networks
Markov logic networks (MLNs) combine first-order logic and Markov networks, allowing us to handle the complexity and uncertainty of real-world problems in a single consistent fram...
Jue Wang, Pedro Domingos