Sciweavers

20197 search results - page 3628 / 4040
» Comparing Computational Power
Sort
View
DAM
2000
137views more  DAM 2000»
15 years 4 months ago
Solving the feedback vertex set problem on undirected graphs
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
Lorenzo Brunetta, Francesco Maffioli, Marco Trubia...
126
Voted
FGCS
2000
81views more  FGCS 2000»
15 years 4 months ago
Managing the operator ordering problem in parallel databases
This paper focuses on parallel query optimization. We consider the operator problem and introduce a new class of execution strategies called Linear-Oriented Bushy Trees (LBTs). Co...
Harald Kosch
IGPL
2000
152views more  IGPL 2000»
15 years 4 months ago
An Analysis of Empirical Testing for Modal Decision Procedures
Recent years have seen the emergence of a new generation of heavily-optimised modal decision procedures. Several systems based on such procedures are now available and have proved...
Ian Horrocks, Peter F. Patel-Schneider, Roberto Se...
CSDA
2007
152views more  CSDA 2007»
15 years 4 months ago
Robust variable selection using least angle regression and elemental set sampling
In this paper we address the problem of selecting variables or features in a regression model in the presence of both additive (vertical) and leverage outliers. Since variable sel...
Lauren McCann, Roy E. Welsch
JAR
2000
90views more  JAR 2000»
15 years 4 months ago
Resolution versus Search: Two Strategies for SAT
The paper compares two popular strategies for solving propositional satis ability, backtracking search and resolution, and analyzes the complexity of a directional resolution algo...
Irina Rish, Rina Dechter
« Prev « First page 3628 / 4040 Last » Next »