Sciweavers

2038 search results - page 297 / 408
» Probabilistic Agent Programs
Sort
View
123
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...
206
Voted
GLOBAL
2003
Springer
15 years 7 months ago
The Klaim Project: Theory and Practice
Klaim (Kernel Language for Agents Interaction and Mobility) is an experimental language specifically designed to program distributed systems consisting of several mobile component...
Lorenzo Bettini, Viviana Bono, Rocco De Nicola, Gi...
115
Voted
AAAI
2008
15 years 4 months ago
H-DPOP: Using Hard Constraints for Search Space Pruning in DCOP
In distributed constraint optimization problems, dynamic programming methods have been recently proposed (e.g. DPOP). In dynamic programming many valuations are grouped together i...
Akshat Kumar, Adrian Petcu, Boi Faltings
105
Voted
AAAI
2008
15 years 4 months ago
Learning to Analyze Binary Computer Code
We present a novel application of structured classification: identifying function entry points (FEPs, the starting byte of each function) in program binaries. Such identification ...
Nathan E. Rosenblum, Xiaojin Zhu, Barton P. Miller...
141
Voted
AAAI
2006
15 years 4 months ago
Fast SAT-based Answer Set Solver
Recent research shows that SAT (propositional satisfiability) techniques can be employed to build efficient systems to compute answer sets for logic programs. ASSAT and CMODELS ar...
Zhijun Lin, Yuanlin Zhang, Hector Hernandez