Sciweavers

13603 search results - page 273 / 2721
» On the Computational Complexity of Cut-Reduction
Sort
View
CDES
2006
99views Hardware» more  CDES 2006»
15 years 8 months ago
Teraflop Computing for Nanoscience
: Over the last three decades there has been significant progress in the first principles methods for calculating the properties of materials at the quantum level. They have largel...
Yang Wang 0008, G. M. Stocks, Aurelian Rusanu, D. ...
164
Voted
EUSFLAT
2001
127views Fuzzy Logic» more  EUSFLAT 2001»
15 years 8 months ago
Soft computing in investment appraisal
Standard financial techniques neglect extreme situations and regards large market shifts as too unlikely to matter. Such approach accounts for what occurs most of the time in the ...
Antoaneta Serguieva, John Hunter, Tatiana Kalganov...
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...