Sciweavers

5084 search results - page 378 / 1017
» Proving Possibility Properties
Sort
View
JUCS
2002
79views more  JUCS 2002»
15 years 6 months ago
Some Notes on Fine Computability
: A metric defined by Fine induces a topology on the unit interval which is strictly stronger than the ordinary Euclidean topology and which has some interesting applications in Wa...
Vasco Brattka
MOC
2002
75views more  MOC 2002»
15 years 6 months ago
Quincunx fundamental refinable functions and quincunx biorthogonal wavelets
Abstract. We analyze the approximation and smoothness properties of quincunx fundamental refinable functions. In particular, we provide a general way for the construction of quincu...
Bin Han 0003, Rong-Qing Jia
TCS
2002
15 years 6 months ago
A formal approach to object-oriented software engineering
We show how formal specifications can be integrated into one of the current pragmatic object-oriented software development methods. Jacobson's "Object-Oriented Software ...
Martin Wirsing, Alexander Knapp
MP
2007
95views more  MP 2007»
15 years 6 months ago
Smoothed analysis of integer programming
We present a probabilistic analysis of integer linear programs (ILPs). More specifically, we study ILPs in a so-called smoothed analysis in which it is assumed that first an adve...
Heiko Röglin, Berthold Vöcking
GC
2010
Springer
15 years 5 months ago
Integer Functions on the Cycle Space and Edges of a Graph
A directed graph has a natural Z-module homomorphism from the underlying graph’s cycle space to Z where the image of an oriented cycle is the number of forward edges minus the n...
Daniel C. Slilaty