Sciweavers

693 search results - page 44 / 139
» Categorical Properties of The Complex Numbers
Sort
View
HYBRID
1999
Springer
13 years 12 months ago
An Overview of Hybrid Simulation Phenomena and Their Support by Simulation Packages
Continuous system dynamics can be described by, possibly large, systems of di erential equations. These can be either ordinary di erential equations (ODEs) or contain algebraic con...
Pieter J. Mosterman
FSE
2005
Springer
108views Cryptology» more  FSE 2005»
14 years 1 months ago
Unbiased Random Sequences from Quasigroup String Transformations
Abstract. The need of true random number generators for many purposes (ranging from applications in cryptography and stochastic simulation, to search heuristics and game playing) i...
Smile Markovski, Danilo Gligoroski, Ljupco Kocarev
NIPS
2007
13 years 9 months ago
What makes some POMDP problems easy to approximate?
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...
David Hsu, Wee Sun Lee, Nan Rong
PODC
2011
ACM
12 years 10 months ago
Locally checkable proofs
This work studies decision problems from the perspective of nondeterministic distributed algorithms. For a yes-instance there must exist a proof that can be verified with a distri...
Mika Göös, Jukka Suomela
APPROX
2005
Springer
94views Algorithms» more  APPROX 2005»
14 years 1 months ago
Testing Periodicity
A string α ∈ Σn is called p-periodic, if for every i, j ∈ {1, . . . , n}, such that i ≡ j mod p, αi = αj, where αi is the i-th place of α. A string α ∈ Σn is said t...
Oded Lachish, Ilan Newman