Sciweavers

5090 search results - page 428 / 1018
» Constructing Strategies for Programming
Sort
View
SPIESR
2000
130views Database» more  SPIESR 2000»
15 years 8 months ago
Compression of large binary images in digital spatial libraries
A method for lossless compression of large binary images is proposed for applications where spatial access to the image is needed. The method utilizes the advantages of (1) variabl...
Eugene I. Ageenko, Pasi Fränti
AMC
2005
125views more  AMC 2005»
15 years 6 months ago
Wavelet multilayer Taylor Galerkin schemes for hyperbolic and parabolic problems
In this study wavelet based high-order Taylor Galerkin methods is introduced. Additional time layers are used to obtain high-order temporal accuracy unattainable within a two-step...
B. V. Rathish Kumar, Mani Mehra
CAI
2004
Springer
15 years 6 months ago
A Generic Dual Core Architecture with Error Containment
The dual core strategy allows to construct a fail-silent processor from two instances (master/checker) of any arbitrary standard processor. Its main drawbacks are its vulnerability...
Thomas Kottke, Andreas Steininger
TCS
2002
15 years 6 months ago
Martin's game: a lower bound for the number of sets
We investigate Martin's game (as described in Arruda et al. (Eds.), On Random R. E. Sets, Non-Classical Logics, Model Theory and Computability, North-Holland, Amsterdam, 1977...
M. Ageev
172
Voted
JOLLI
2010
85views more  JOLLI 2010»
15 years 5 months ago
Information Tracking in Games on Graphs
Abstract. When seeking to coordinate in a game with imperfect information, it is often relevant for a player to know what other players know. Keeping track of the information acqui...
Dietmar Berwanger, Lukasz Kaiser