Sciweavers

7167 search results - page 1122 / 1434
» Answer Set Programming
Sort
View
IJFCS
2007
98views more  IJFCS 2007»
15 years 2 months ago
Modular Ranking Abstraction
Ranking Abstraction Ittai Balaban Computer Science Department, New York University, 251 Mercer St., New York, New York 10012, United States and Amir Pnueli Computer Science Departm...
Ittai Balaban, Amir Pnueli, Lenore D. Zuck
ASE
2005
137views more  ASE 2005»
15 years 2 months ago
Rewriting-Based Techniques for Runtime Verification
Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...
Grigore Rosu, Klaus Havelund
BMCBI
2005
158views more  BMCBI 2005»
15 years 2 months ago
Automated generation of heuristics for biological sequence comparison
Background: Exhaustive methods of sequence alignment are accurate but slow, whereas heuristic approaches run quickly, but their complexity makes them more difficult to implement. ...
Guy St. C. Slater, Ewan Birney
CACM
1998
127views more  CACM 1998»
15 years 2 months ago
The Virtual Reality Modeling Language and Java
Abstract. The Virtual Reality Modeling Language (VRML) and Java provide a standardized, portable and platformindependent way to render dynamic, interactive 3D scenes across the Int...
Donald P. Brutzman
ICST
2010
IEEE
15 years 1 months ago
(Un-)Covering Equivalent Mutants
—Mutation testing measures the adequacy of a test suite by seeding artificial defects (mutations) into a program. If a test suite fails to detect a mutation, it may also fail to...
David Schuler, Andreas Zeller
« Prev « First page 1122 / 1434 Last » Next »