Sciweavers

630 search results - page 35 / 126
» Symbolic Domain Decomposition
Sort
View
ICMS
2010
14 years 11 months ago
The Reformulation-Optimization Software Engine
Abstract. Most optimization software performs numerical computation, in the sense that the main interest is to find numerical values to assign to the decision variables, e.g. a so...
Leo Liberti, Sonia Cafieri, David Savourey
GPEM
2008
128views more  GPEM 2008»
15 years 22 days ago
Coevolutionary bid-based genetic programming for problem decomposition in classification
In this work a cooperative, bid-based, model for problem decomposition is proposed with application to discrete action domains such as classification. This represents a significan...
Peter Lichodzijewski, Malcolm I. Heywood
50
Voted
ICC
2007
IEEE
15 years 7 months ago
An ESPAR Antenna for Beamspace-MIMO Systems Using PSK Modulation Schemes
— In this paper the use of electronically steerable passive array radiator (ESPAR) antennas is introduced for achieving increased spectral efficiency characteristics in multiple-...
Antonis Kalis, Constantinos B. Papadias
PLDI
2010
ACM
15 years 5 months ago
Mixing type checking and symbolic execution
Static analysis designers must carefully balance precision and efficiency. In our experience, many static analysis tools are built around an elegant, core algorithm, but that alg...
Yit Phang Khoo, Bor-Yuh Evan Chang, Jeffrey S. Fos...
105
Voted
SPIN
2009
Springer
15 years 7 months ago
Subsumer-First: Steering Symbolic Reachability Analysis
Abstract. Symbolic reachability analysis provides a basis for the verification of software systems by offering algorithmic support for the exploration of the program state space ...
Andrey Rybalchenko, Rishabh Singh