Sciweavers

246 search results - page 7 / 50
» A novel approach to symbolic algebra
Sort
View
CONSTRAINTS
1998
127views more  CONSTRAINTS 1998»
13 years 7 months ago
Experimental Analysis of Numeric and Symbolic Constraint Satisfaction Techniques for Temporal Reasoning
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...
Malek Mouhoub, François Charpillet, Jean Pa...
SODA
2008
ACM
106views Algorithms» more  SODA 2008»
13 years 8 months ago
Exact and efficient 2D-arrangements of arbitrary algebraic curves
We show how to compute the planar arrangement induced by segments of arbitrary algebraic curves with the Bentley-Ottmann sweep-line algorithm. The necessary geometric primitives r...
Arno Eigenwillig, Michael Kerber
PLDI
2009
ACM
14 years 2 months ago
Snugglebug: a powerful approach to weakest preconditions
Symbolic analysis shows promise as a foundation for bug-finding, specification inference, verification, and test generation. This paper addresses demand-driven symbolic analysi...
Satish Chandra, Stephen J. Fink, Manu Sridharan
VTC
2006
IEEE
117views Communications» more  VTC 2006»
14 years 1 months ago
Adaptive Minimum Symbol Error Rate Beamforming Assisted Receiver for Quadrature Amplitude Modulated Systems
An adaptive beamforming assisted receiver is proposed for multiple antenna aided multiuser systems that employ bandwidth efficient quadrature amplitude modulation (QAM). A novel m...
Sheng Chen, H.-Q. Du, Lajos Hanzo
CONCUR
2001
Springer
13 years 12 months ago
Symbolic Computation of Maximal Probabilistic Reachability
We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of ...
Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sprost...