Sciweavers

967 search results - page 156 / 194
» Probabilistic Predicative Programming
Sort
View
CSMR
2004
IEEE
15 years 6 months ago
A Distributed Architecture for Dynamic Analyses on User-Profile Data
Combining static and dynamic information is highly relevant in many reverse engineering, program comprehension and maintenance task. Dynamic analysis is particularly effective whe...
Giuliano Antoniol, Massimiliano Di Penta
CPAIOR
2008
Springer
15 years 4 months ago
Stochastic Satisfiability Modulo Theories for Non-linear Arithmetic
Abstract. The stochastic satisfiability modulo theories (SSMT) problem is a generalization of the SMT problem on existential and randomized (aka. stochastic) quantification over di...
Tino Teige, Martin Fränzle
121
Voted
ICASSP
2010
IEEE
15 years 2 months ago
A robust minimum volume enclosing simplex algorithm for hyperspectral unmixing
Hyperspectral unmixing is a process of extracting hidden spectral signatures (or endmembers) and the corresponding proportions (or abundances) of a scene, from its hyperspectral o...
Arul-Murugan Ambikapathi, Tsung-Han Chan, Wing-Kin...
JUCS
2010
142views more  JUCS 2010»
15 years 24 days ago
Mobile Agent Routing with Time Constraints: A Resource Constrained Longest-Path Approach
: Mobile agent technology advocates the mobility of code rather than the transfer of data. As data is found in several sites, a mobile agent has to plan an itinerary to visit sever...
Eduardo Camponogara, Ricardo Boveto Shima
SIGSOFT
2005
ACM
16 years 3 months ago
Permissive interfaces
A modular program analysis considers components independently and provides succinct summaries for each component, which can be used when checking the rest of the system. Consider ...
Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar