Sciweavers

630 search results - page 11 / 126
» Symbolic Domain Decomposition
Sort
View
MOC
2002
101views more  MOC 2002»
13 years 8 months ago
Global and uniform convergence of subspace correction methods for some convex optimization problems
This paper gives some global and uniform convergence estimates for a class of subspace correction (based on space decomposition) iterative methods applied to some unconstrained con...
Xue-Cheng Tai, Jinchao Xu
GLOBECOM
2009
IEEE
14 years 9 days ago
Dual Transform Domain Echo Canceller for Discrete Multitone Systems
Abstract--In communication systems where full-duplex transmission is required, digital echo cancellers are employed to cancel echo by means of adaptive filtering. In order to reduc...
Neda Ehtiati, Benoît Champagne
JAIR
2010
130views more  JAIR 2010»
13 years 6 months ago
A Constraint Satisfaction Framework for Executing Perceptions and Actions in Diagrammatic Reasoning
Diagrammatic reasoning (DR) is pervasive in human problem solving as a powerful adjunct to symbolic reasoning based on language-like representations. The research reported in this...
Bonny Banerjee, B. Chandrasekaran
ISSTA
2010
ACM
13 years 10 months ago
Exploiting program dependencies for scalable multiple-path symbolic execution
This paper presents a new technique, called Symbolic Program Decomposition (or SPD), for symbolic execution of multiple paths that is more scalable than existing techniques, which...
Raúl A. Santelices, Mary Jean Harrold
MASCOTS
2004
13 years 9 months ago
Dual-Processor Parallelisation of Symbolic Probabilistic Model Checking
In this paper, we describe the dual-processor parallelisation of a symbolic (BDD-based) implementation of probabilistic model checking. We use multi-terminal BDDs, which allow a c...
Marta Z. Kwiatkowska, David Parker, Yi Zhang, Rash...