Sciweavers

16843 search results - page 300 / 3369
» On Generalized Authorization Problems
Sort
View
JUCS
2002
125views more  JUCS 2002»
15 years 6 months ago
Mental Models to Represent Dynamics - Using the Example "factorial"
: To use hypertext/hypermedia elements in teaching at universities an author not only needs knowledge of the technological possibilities. In addition he/she has to renew a here so ...
Gisbert Dittrich
COCOA
2008
Springer
15 years 8 months ago
Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...
Shai Gutner
CIE
2007
Springer
16 years 24 days ago
Post's Problem for Ordinal Register Machines
We study Post’s Problem for the ordinal register machines defined in [6], showing that its general solution is positive, but that any set of ordinals solving it must be unbounde...
Joel David Hamkins, Russell G. Miller
CSL
2007
Springer
15 years 10 months ago
Logical Refinements of Church's Problem
Abstract. Church's Problem (1962) asks for the construction of a procedure which, given a logical specification on sequence pairs, realizes for any input sequence X an output...
Alexander Rabinovich, Wolfgang Thomas
AAIM
2010
Springer
155views Algorithms» more  AAIM 2010»
15 years 9 months ago
The (K, k)-Capacitated Spanning Tree Problem
Abstract. This paper considers a generalization of the capacitated spanning tree, in which some of the nodes have capacity K, and the others have capacity k < K. We prove that t...
Esther M. Arkin, Nili Guttmann-Beck, Refael Hassin