Sciweavers

3719 search results - page 78 / 744
» order 2010
Sort
View
95
Voted
JGO
2010
89views more  JGO 2010»
14 years 11 months ago
Stopping rules in k-adaptive global random search algorithms
In this paper we develop a methodology for defining stopping rules in a general class of global random search algorithms that are based on the use of statistical procedures. To bu...
Anatoly A. Zhigljavsky, Emily Hamilton
JUCS
2010
114views more  JUCS 2010»
14 years 11 months ago
An Axiomatization of a First-order Branching Time Temporal Logic
: We introduce a first-order temporal logic for reasoning about branching time. It is well known that the set of valid formulas is not recursively enumerable and there is no fini...
Dragan Doder, Zoran Ognjanovic, Zoran Markovic
116
Voted
TCS
2010
14 years 7 months ago
Definable transductions and weighted logics for texts
A text is a word together with an additional linear order on it. We study quantitative models for texts, i.e. text series which assign to texts elements of a semiring. We introduc...
Christian Mathissen
80
Voted
FFA
2010
139views more  FFA 2010»
14 years 11 months ago
Coset bounds for algebraic geometric codes
We develop new coset bounds for algebraic geometric codes. The bounds have a natural interpretation as an adversary threshold for algebraic geometric secret sharing schemes and le...
Iwan M. Duursma, Seungkook Park
LICS
2010
IEEE
14 years 11 months ago
On the Expressivity of Symmetry in Event Structures
—This paper establishes a bridge between presheaf models for concurrency and the more operationally-informative world of event structures. It concentrates on a particular preshea...
Sam Staton, Glynn Winskel