Sciweavers

749 search results - page 94 / 150
» Combinatory Models and Symbolic Computation
Sort
View
JMLR
2006
125views more  JMLR 2006»
13 years 10 months ago
Linear Programming Relaxations and Belief Propagation - An Empirical Study
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
Chen Yanover, Talya Meltzer, Yair Weiss
IPPS
2007
IEEE
14 years 4 months ago
SWARM: A Parallel Programming Framework for Multicore Processors
Due to fundamental physical limitations and power constraints, we are witnessing a radical change in commodity microprocessor architectures to multicore designs. Continued perform...
David A. Bader, Varun Kanade, Kamesh Madduri
GECCO
2009
Springer
113views Optimization» more  GECCO 2009»
14 years 2 months ago
Variable size population for dynamic optimization with genetic programming
A new model of Genetic Programming with variable size population is presented in this paper and applied to the reconstruction of target functions in dynamic environments (i.e. pro...
Leonardo Vanneschi, Giuseppe Cuccu
COLING
2002
13 years 10 months ago
Selforganizing Classification on the Reuters News Corpus
In this paper we propose an integration of a selforganizing map and semantic networks from WordNet for a text classification task using the new Reuters news corpus. This neural mo...
Stefan Wermter, Chihli Hung
AAAI
2008
14 years 11 days ago
Optimal Metric Planning with State Sets in Automata Representation
This paper proposes an optimal approach to infinite-state action planning exploiting automata theory. State sets and actions are characterized by Presburger formulas and represent...
Björn Ulrich Borowsky, Stefan Edelkamp