Sciweavers

8903 search results - page 1587 / 1781
» Alternative
Sort
View
VLDB
1997
ACM
97views Database» more  VLDB 1997»
15 years 10 months ago
The Complexity of Transformation-Based Join Enumeration
Query optimizers that explore a search space exhaustively using transformation rules usually apply all possible rules on each alternative, and stop when no new information is prod...
Arjan Pellenkoft, César A. Galindo-Legaria,...
WLP
1997
Springer
15 years 10 months ago
Constrained Partial Deduction
eduction strategies for logic programs often use an abstraction operator to guarantee the niteness of the set of goals for which partial deductions are . Findingan abstraction ope...
Michael Leuschel, Danny De Schreye
LICS
1994
IEEE
15 years 10 months ago
On the Parallel Complexity of Model Checking in the Modal Mu-Calculus
The modal mu-calculus is an expressive logic that can be used to specify safety and liveness properties of concurrent systems represented as labeled transition systems (LTSs). We ...
Shipei Zhang, Oleg Sokolsky, Scott A. Smolka
EUROSYS
2010
ACM
15 years 10 months ago
Fingerprinting the Datacenter: Automated Classification of Performance Crises
When a performance crisis occurs in a datacenter, rapid recovery requires quickly recognizing whether a similar incident occurred before, in which case a known remedy may apply, o...
Peter Bodik, Moises Goldszmidt, Armando Fox, Dawn ...
CHI
1993
ACM
15 years 10 months ago
Hyperspeech
HTTP provides a mechanism to connect web sites. Almost all sites have a large amount of hypertext content that provides connection to other sites in the World Wide Web. The succes...
Barry Arons
« Prev « First page 1587 / 1781 Last » Next »