Sciweavers

630 search results - page 14 / 126
» Symbolic Domain Decomposition
Sort
View
NFM
2011
335views Formal Methods» more  NFM 2011»
13 years 2 months ago
CORAL: Solving Complex Constraints for Symbolic PathFinder
Symbolic execution is a powerful automated technique for generating test cases. Its goal is to achieve high coverage of software. One major obstacle in adopting the technique in pr...
Matheus Souza, Mateus Borges, Marcelo d'Amorim, Co...
IJCAI
2001
13 years 9 months ago
SiN: Integrating Case-based Reasoning with Task Decomposition
This paper describes SiN, a novel case-based planning algorithm that combines conversational case retrieval with generative planning. SiN is provably correct, and can generate pla...
Héctor Muñoz-Avila, David W. Aha, Da...
ICDAR
2003
IEEE
14 years 1 months ago
An Evolutionary Algorithm for General Symbol Segmentation
A new system is presented for general symbol segmentation, which is applicable for segmentation of any connected string of symbols, including characters and line diagrams. Using a...
Stephen Pearce, Maher Ahmed
ICLP
1994
Springer
14 years 16 days ago
Entailment of Finite Domain Constraints
Using a glass-box theory of finite domain constraints, FD, we show how the entailment of user-defined constraints can be expressed by antimonotone FD constraints. We also provide a...
Björn Carlson, Mats Carlsson, Daniel Diaz
ICASSP
2008
IEEE
14 years 2 months ago
Blind channel estimation in DS-CDMA systems with unknown wide-sense stationary noise using generalized correlation decomposition
A novel blind subspace-based channel estimation technique is developed for direct-sequence code division multiple-access (DS-CDMA) systems operating in unknown wide-sense stationa...
Keyvan Zarifi, Alex B. Gershman