Sciweavers

507 search results - page 47 / 102
» Counterexample-Guided Abstraction Refinement
Sort
View
AIPS
1998
13 years 11 months ago
Search Control of Plan Generation in Decision-Theoretic Planners
This paper addresses the search control problemof selecting whichplan to refine next for decision-theoretic planners, a choice point commonto the decision theoretic planners creat...
Richard Goodwin, Reid G. Simmons
JAR
2006
103views more  JAR 2006»
13 years 10 months ago
A Framework for Verifying Bit-Level Pipelined Machines Based on Automated Deduction and Decision Procedures
We describe an approach to verifying bit-level pipelined machine models using a combination of deductive reasoning and decision procedures. While theorem proving systems such as AC...
Panagiotis Manolios, Sudarshan K. Srinivasan
ANTSW
2004
Springer
14 years 1 months ago
Mesh-Partitioning with the Multiple Ant-Colony Algorithm
ed Abstract We present two heuristic mesh-partitioning methods, both of which build on the multiple ant-colony algorithm in order to improve the quality of the mesh partitions. The...
Peter Korosec, Jurij Silc, Borut Robic
ICDE
2008
IEEE
190views Database» more  ICDE 2008»
14 years 11 months ago
Efficient Query Processing in Large Traffic Networks
Abstract-- We present an original graph embedding to speedup distance-range and k-nearest neighbor queries on static and/or dynamic objects located on a (weighted) graph. Our metho...
Hans-Peter Kriegel, Matthias Renz, Peer Kröge...
AMAST
1998
Springer
14 years 2 months ago
Architectural Specifications in CASL
Abstract. One of the most novel features of Casl, the Common Algebraic Specification Language, is the provision of so-called architectural specifications for describing the modular...
Michel Bidoit, Donald Sannella, Andrzej Tarlecki