Sciweavers

2412 search results - page 52 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
DIS
2003
Springer
14 years 3 months ago
Abduction and the Dualization Problem
Computing abductive explanations is an important problem, which has been studied extensively in Artificial Intelligence (AI) and related disciplines. While computing some abductiv...
Thomas Eiter, Kazuhisa Makino
SPAA
2005
ACM
14 years 3 months ago
Dynamic circular work-stealing deque
The non-blocking work-stealing algorithm of Arora, Blumofe, and Plaxton (henceforth ABP work-stealing) is on its way to becoming the multiprocessor load balancing technology of ch...
David Chase, Yossi Lev
BMCBI
2006
128views more  BMCBI 2006»
13 years 10 months ago
Comparative assessment of performance and genome dependence among phylogenetic profiling methods
Background: The rapidly increasing speed with which genome sequence data can be generated will be accompanied by an exponential increase in the number of sequenced eukaryotes. Wit...
Evan S. Snitkin, Adam M. Gustafson, Joseph C. Mell...
ICDT
2007
ACM
141views Database» more  ICDT 2007»
14 years 4 months ago
Exact XML Type Checking in Polynomial Time
Stay macro tree transducers (smtts) are an expressive formalism for reasoning about XSLT-like document transformations. Here, we consider the exact type checking problem for smtts....
Sebastian Maneth, Thomas Perst, Helmut Seidl
CD
2005
Springer
14 years 3 months ago
A Decentralized Redeployment Algorithm for Improving the Availability of Distributed Systems
In distributed and mobile environments, the connections among the hosts on which a software system is running are often unstable. As a result of connectivity losses, the overall a...
Sam Malek, Marija Mikic-Rakic, Nenad Medvidovic