Sciweavers

1204 search results - page 178 / 241
» Hybrid Probabilistic Programs
Sort
View
JMLR
2006
89views more  JMLR 2006»
13 years 9 months ago
Maximum-Gain Working Set Selection for SVMs
Support vector machines are trained by solving constrained quadratic optimization problems. This is usually done with an iterative decomposition algorithm operating on a small wor...
Tobias Glasmachers, Christian Igel
ENGL
2007
136views more  ENGL 2007»
13 years 9 months ago
Multilayered Evolutionary Architecture for Behaviour Arbitration in Cognitive Agents
— In this work, an hybrid, self-configurable, multilayered and evolutionary subsumption architecture for cognitive agents is developed. Each layer of the multilayered architectur...
Oscar Javier Romero López
CSMR
2004
IEEE
14 years 1 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
ICASSP
2010
IEEE
13 years 10 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»
13 years 8 months 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