Sciweavers

1449 search results - page 53 / 290
» Self-Randomized Exponentiation Algorithms
Sort
View
103
Voted
CCCG
2010
15 years 2 months ago
Finding minimal bases in arbitrary spline spaces
In this work we describe a general algorithm to find a finite-element basis with minimum total support for an arbitrary spline space, given any basis for that same space. The runn...
Ana Paula Malheiro, Jorge Stolfi
ACTA
2007
114views more  ACTA 2007»
15 years 20 days ago
Recursive descent parsing for Boolean grammars
The recursive descent parsing method for the context-free grammars is extended for their generalization, Boolean grammars, which include explicit set-theoretic operations in the f...
Alexander Okhotin
SC
1993
ACM
15 years 4 months ago
Optimal fully adaptive wormhole routing for meshes
A deadlock-free fully adaptive routing algorithm for 2D meshes which is optimal in the number of virtual channels required and in the number of restrictions placed on the use of t...
Loren Schwiebert, D. N. Jayasimha
AAAI
2008
15 years 2 months ago
How Good is Almost Perfect?
Heuristic search using algorithms such as A and IDA is the prevalent method for obtaining optimal sequential solutions for classical planning tasks. Theoretical analyses of these ...
Malte Helmert, Gabriele Röger
DLOG
2007
15 years 2 months ago
Blocking Automata for PSPACE DLs
In Description Logics (DLs), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problems such as c...
Franz Baader, Jan Hladik, Rafael Peñaloza