Sciweavers

2657 search results - page 35 / 532
» On the complexity of hierarchical problem solving
Sort
View
AAAI
1996
14 years 11 months ago
Building Steady-State Simulators via Hierarchical Feedback Decomposition
In recent years, compositional modeling and selfexplanatory simulation techniques have simplified the process of building dynamic simulators of physical systems. Building steady-s...
Nicolas F. Rouquette
COCO
2000
Springer
107views Algorithms» more  COCO 2000»
15 years 1 months ago
On the Complexity of Intersecting Finite State Automata
We consider the problem of testing whether the intersection of a collection of k automata is empty. The straightforward algorithm for solving this problem runs in time k where is...
George Karakostas, Richard J. Lipton, Anastasios V...
72
Voted
AIS
2004
Springer
15 years 3 months ago
Proposal of High Level Architecture Extension
The paper proposes three dimensional extension to High Level ARchitecture (HLA) and Runtime Infrastructure (RTI) to solve several issues such as security, information hiding proble...
Jae-Hyun Kim, Tag Gon Kim
SC
2009
ACM
15 years 2 months ago
GPU based sparse grid technique for solving multidimensional options pricing PDEs
It has been shown that the sparse grid combination technique can be a practical tool to solve high dimensional PDEs arising in multidimensional option pricing problems in finance...
Abhijeet Gaikwad, Ioane Muni Toke
AISC
2006
Springer
15 years 1 months ago
Hierarchical Representations with Signatures for Large Expression Management
Abstract. We describe a method for managing large expressions in symbolic computations which combines a hierarchical representation with signature calculations. As a case study, th...
Wenqin Zhou, Jacques Carette, David J. Jeffrey, Mi...