Sciweavers

249 search results - page 19 / 50
» One Complexity Theorist's View of Quantum Computing
Sort
View
ECAI
1994
Springer
15 years 1 months ago
Combining the Lazy Label Evaluation with Focusing Techniques in an ATMS
For large problems the ATMS often becomes the main resource consumer in any reasoning system. We propose an architecture (the 2vATMS) that combines the advantages of two techniques...
Mugur M. Tatar
78
Voted
CORR
2000
Springer
91views Education» more  CORR 2000»
14 years 9 months ago
Algorithmic Theories of Everything
The probability distribution P from which the history of our universe is sampled represents a theory of everything or TOE. We assume P is formally describable. Since most (uncount...
Jürgen Schmidhuber
PVLDB
2008
103views more  PVLDB 2008»
14 years 9 months ago
A request-routing framework for SOA-based enterprise computing
Enterprises may use a service-oriented architecture (SOA) to provide a streamlined interface to their business processes. To scale up the system, each tier in a composite service ...
Thomas Phan, Wen-Syan Li
CIE
2007
Springer
15 years 3 months ago
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
Michael R. Fellows, Frances A. Rosamond
73
Voted
ICDT
2007
ACM
126views Database» more  ICDT 2007»
15 years 3 months ago
Combining Incompleteness and Ranking in Tree Queries
Abstract. In many cases, users may want to consider incomplete answers to their queries. Often, however, there is an overwhelming number of such answers, even if subsumed answers a...
Benny Kimelfeld, Yehoshua Sagiv