Sciweavers

470 search results - page 73 / 94
» FORM facts
Sort
View
WDAG
2009
Springer
166views Algorithms» more  WDAG 2009»
14 years 4 months ago
New Bounds for the Controller Problem
The (M, W)-controller, originally studied by Afek, Awerbuch, Plotkin, and Saks, is a basic ted tool that provides an abstraction for managing the consumption of a global resource ...
Yuval Emek, Amos Korman
CCA
2009
Springer
14 years 4 months ago
Weihrauch Degrees, Omniscience Principles and Weak Computability
Abstract. In this paper we study a reducibility that has been introduced by Klaus Weihrauch or, more precisely, a natural extension of this reducibility for multi-valued functions ...
Vasco Brattka, Guido Gherardi
COCO
2009
Springer
115views Algorithms» more  COCO 2009»
14 years 4 months ago
Locally Testable Codes Require Redundant Testers
Locally testable codes (LTCs) are error-correcting codes for which membership, in the code, of a given word can be tested by examining it in very few locations. Most known constru...
Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman...
FGCN
2008
IEEE
143views Communications» more  FGCN 2008»
14 years 4 months ago
The Study of Location Strategy for Bank
In this paper, authors attempt to shed light on the factors that influence the locations of bank branches in establishing a bank’s branch network from the angle of the network a...
Jae Weon Hong, Won Eui Hong, Yoon-Sik Kwak
LICS
2008
IEEE
14 years 4 months ago
Reachability Games and Game Semantics: Comparing Nondeterministic Programs
We investigate the notions of may- and mustapproximation in Erratic Idealized Algol (a nondeterministic extension of Idealized Algol), and give explicit characterizations of both ...
Andrzej S. Murawski