Sciweavers

10156 search results - page 8 / 2032
» Step by Step to Histories
Sort
View
ICCS
2004
Springer
14 years 1 months ago
Reuse of Paths in Final Gathering Step with Moving Light Sources
Abstract. In this paper we extend our previous result on reusing shooting paths when dealing with moving light sources in radiosity to the final gathering step algorithm, which co...
Mateu Sbert, Francesc Castro
FSTTCS
2007
Springer
14 years 2 months ago
Solving Parity Games in Big Steps
Abstract. This paper proposes a new algorithm that improves the complexity bound for solving parity games. Our approach combines McNaughton’s iterated fixed point algorithm with...
Sven Schewe
VLDB
2004
ACM
101views Database» more  VLDB 2004»
14 years 1 months ago
Taming XPath Queries by Minimizing Wildcard Steps
This paper presents a novel and complementary technique to optimize an XPath query by minimizing its wildcard steps. Our approach is based on using a general composite axis called...
Chee Yong Chan, Wenfei Fan, Yiming Zeng
BMAS
2000
IEEE
14 years 26 days ago
Dynamic Time Step Control Algorithm Enhancements
Analog simulators typically use a dynamic, adaptive time step control strategy in order to minimize the calculations performed during inactive portions of a system’s operation, ...
James C. (Jim) Bach
ASMTA
2009
Springer
114views Mathematics» more  ASMTA 2009»
14 years 14 days ago
Improving the Efficiency of the Proxel Method by Using Individual Time Steps
Discrete stochastic models (DSM) are widely used in various application fields today. Proxel-based simulation can outperform discrete event-based approaches in the analysis of smal...
Claudia Krull, Robert Buchholz, Graham Horton