Sciweavers

664 search results - page 2 / 133
» Some results for a class of generalized polynomials
Sort
View
JSYML
1998
64views more  JSYML 1998»
13 years 7 months ago
Some Two-Cardinal Results for O-Minimal Theories
We examine two-cardinal problems for the class of O-minimal theories. We prove that an O-minimal theory which admits some (κ, λ) must admit every (κ , λ ). We also prove that ...
Timothy Bays
FUIN
2000
68views more  FUIN 2000»
13 years 7 months ago
Models For Dependable Computation with Multiple Inputs and Some Hardness Results
We consider the problem of dependable computation with multiple inputs. The goal is to study when redundancy can help to achieve survivability and when it cannot. We use AND/OR gra...
Yongge Wang, Yvo Desmedt, Mike Burmester
NETWORKS
2010
13 years 5 months ago
Complexity of some inverse shortest path lengths problems
The input to an Inverse Shortest Path Lengths Problem (ISPL) consists of a graph G with arc weights, and a collection of source-sink pairs with prescribed distances that do not ne...
Tingting Cui, Dorit S. Hochbaum
CORR
2008
Springer
131views Education» more  CORR 2008»
13 years 7 months ago
Optimizing polynomials for floating-point implementation
The floating-point implementation of a function often reduces to a polynomial approximation on an interval. Remez algorithm provides the polynomial closest to the function, but th...
Florent de Dinechin, Christoph Quirin Lauter
NMR
2004
Springer
14 years 22 days ago
Generalizing the AGM postulates: preliminary results and applications
One of the crucial actions any reasoning system must undertake is the updating of its Knowledge Base (KB). This problem is usually referred to as the problem of belief change. The...
Giorgos Flouris, Dimitris Plexousakis, Grigoris An...