Sciweavers

14190 search results - page 203 / 2838
» computer 2008
Sort
View
BSL
2008
97views more  BSL 2008»
15 years 4 months ago
The Complexity of Orbits of Computably Enumerable Sets
The goal of this paper is to announce there is a single orbit of the c.e. sets with inclusion, E, such that the question of membership in this orbit is 1 1-complete. This result an...
Peter Cholak, Rodney G. Downey, Leo Harrington
DAM
2008
102views more  DAM 2008»
15 years 4 months ago
On the computational complexity of partial covers of Theta graphs
By use of elementary geometric arguments we prove the existence of a special integral solution of a certain system of linear equations. The existence of such a solution yields the...
Jirí Fiala, Jan Kratochvíl, Attila P...
DISOPT
2008
99views more  DISOPT 2008»
15 years 4 months ago
Computing robust basestock levels
This paper considers how to optimally set the basestock level for a single buffer when demand is uncertain, in a robust framework. We present a family of algorithms based on decom...
Daniel Bienstock, Nuri Özbay
CERA
2006
36views more  CERA 2006»
15 years 4 months ago
Federated Grid Computing with Interactive Service-oriented Programing
er.sagepub.com/cgi/content/abstract/14/1/55 The online version of this article can be found at: Published by: http://www.sagepublications.com can be found at:Concurrent Engineering...
Michael W. Sobolewski, Raymond M. Kolonay
JUCS
2008
122views more  JUCS 2008»
15 years 4 months ago
On the Subrecursive Computability of Several Famous Constants
: For any class F of total functions in the set N of the natural numbers, we define the notion of F-computable real number. A real number is called Fcomputable if there exist one-...
Dimiter Skordev