3897 search results - page 402 / 780 » complexity 2010 |
157
click to vote
ECCC
2010
15 years 6 months ago
2010
An (r, , )-locally decodable code encodes a k-bit message x to an N-bit codeword C(x), such that for every i [k], the i-th message bit can be recovered with probability 1 - , by ...
154
click to vote
ENTCS
2010
15 years 6 months ago
2010
The crucial strength of the component paradigm lies in the possibility to encapsulate behaviours. In this work, we focus on the observable behaviour of composite components which ...
166
click to vote
ENTCS
2010
15 years 6 months ago
2010
The generic modal reasoner CoLoSS covers a wide variety of logics ranging from graded and probabilistic modal logic to coalition logic and conditional logics, being based on a bro...
175
click to vote
ENTCS
2010
15 years 6 months ago
2010
Process modeling languages such as "Dynamical Grammars" are highly expressive in the processes they model using stochastic and deterministic dynamical systems, and can b...
173
click to vote
EOR
2010
15 years 6 months ago
2010
This study investigates an optimization-based heuristic for the Robotic Cell Problem. This problem arises in automated cells and is a complex ow shop problem with a single transpo...