Sciweavers

1263 search results - page 87 / 253
» Packaging Mathematical Structures
Sort
View
METMBS
2004
162views Mathematics» more  METMBS 2004»
14 years 11 months ago
A Comparison of DNA Fragment Assembly Algorithms
As more research centers embark on sequencing new genomes, the problem of DNA fragment assembly for shotgun sequencing is growing in importance and complexity. Accurate and fast a...
Lishan Li, Sami Khuri
AAAI
1998
14 years 11 months ago
Inferring State Constraints for Domain-Independent Planning
Wedescribe somenewpreprocessing techniques that enable faster domain-independentplanning. Thefirst set of techniquesis aimedat inferring state constraints from the structure of pl...
Alfonso Gerevini, Lenhart K. Schubert
WSC
2000
14 years 11 months ago
Automatic generation of simulation models from neutral libraries: an example
Researchers at the National Institute of Standards and Technology have proposed the development of neutral libraries of simulation components. The availability of such libraries w...
Young-Jun Son, Albert Jones, Richard A. Wysk
70
Voted
ENTCS
2006
184views more  ENTCS 2006»
14 years 10 months ago
Scannerless Boolean Parsing
Scannerless generalized parsing techniques allow parsers to be derived directly from unified, declarative specifications. Unfortunately, in order to uniquely parse existing progra...
Adam Megacz
CORR
2002
Springer
123views Education» more  CORR 2002»
14 years 10 months ago
Ideal decompositions and computation of tensor normal forms
Abstract. Symmetry properties of r-times covariant tensors T can be described by certain linear subspaces W of the group ring K[Sr] of a symmetric group Sr. If for a class of tenso...
Bernd Fiedler