Sciweavers

3775 search results - page 236 / 755
» The Expression Problem Revisited
Sort
View
157
Voted
ICTCS
2003
Springer
15 years 10 months ago
On the Computational Complexity of Cut-Elimination in Linear Logic
Abstract. Given two proofs in a logical system with a confluent cutelimination procedure, the cut-elimination problem (CEP) is to decide whether these proofs reduce to the same no...
Harry G. Mairson, Kazushige Terui
ECAI
2006
Springer
15 years 8 months ago
Decision with Uncertainties, Feasibilities, and Utilities: Towards a Unified Algebraic Framework
Several formalisms exist to express and solve decision problems. Each is designed to capture different kinds of knowledge: utilities expressing preferences, uncertainties on the en...
Cédric Pralet, Gérard Verfaillie, Th...
145
Voted
SIAMCOMP
2008
100views more  SIAMCOMP 2008»
15 years 5 months ago
On the Complexity of Verifying Consistency of XML Specifications
XML specifications often consist of a type definition (typically, a DTD) and a set of integrity constraints. It has been shown previously that such specifications can be inconsiste...
Marcelo Arenas, Wenfei Fan, Leonid Libkin
151
Voted
CORR
2011
Springer
169views Education» more  CORR 2011»
15 years 2 days ago
Power Allocation Based on SEP Minimization in Two-Hop Decode-and-Forward Relay Networks
—The problem of optimal power allocation among the relays in a two-hop decode-and-forward cooperative relay network with independent Rayleigh fading channels is considered. It is...
Arash Khabbazibasmenj, Sergiy A. Vorobyov
VLDB
2005
ACM
125views Database» more  VLDB 2005»
15 years 10 months ago
Rewriting XPath Queries Using Materialized Views
As a simple XML query language but with enough expressive power, XPath has become very popular. To expedite evaluation of XPath queries, we consider the problem of rewriting XPath...
Wanhong Xu, Z. Meral Özsoyoglu