Sciweavers

14774 search results - page 378 / 2955
» Computational complexity and evolutionary computation
Sort
View
PDPTA
2004
15 years 8 months ago
Static Performance Evaluation for Memory-Bound Computing: The MBRAM Model
We present the MBRAM model for static evaluation of the performance of memory-bound programs. The MBRAM model predicts the actual running time of a memory-bound program directly fr...
Gene Cooperman, Xiaoqin Ma, Viet Ha Nguyen
IJCAI
2003
15 years 8 months ago
Taming Decentralized POMDPs: Towards Efficient Policy Computation for Multiagent Settings
The problem of deriving joint policies for a group of agents that maximize some joint reward function can be modeled as a decentralized partially observable Markov decision proces...
Ranjit Nair, Milind Tambe, Makoto Yokoo, David V. ...
WSCG
2003
143views more  WSCG 2003»
15 years 8 months ago
Fast Algorithm for Stochastic Tree Computation
In this paper, a recursive algorithm that can build complex tree structure quickly is presented briefly. The plant structural growth is based on a dual-scale automaton, in which â...
Meng-Zhen Kang, Philippe de Reffye, Jean Fran&cced...
CSJM
2008
88views more  CSJM 2008»
15 years 6 months ago
A zero-dimensional approach to compute real radicals
The notion of real radicals is a fundamental tool in Real Algebraic Geometry. It takes the role of the radical ideal in Complex Algebraic Geometry. In this article I shall describ...
Silke J. Spang
166
Voted
CVIU
2008
109views more  CVIU 2008»
15 years 6 months ago
Performance vs computational efficiency for optimizing single and dynamic MRFs: Setting the state of the art with primal-dual st
In this paper we introduce a novel method to address minimization of static and dynamic MRFs. Our approach is based on principles from linear programming and, in particular, on pr...
Nikos Komodakis, Georgios Tziritas, Nikos Paragios