Results 261 to 270 of about 2,081,615 (312)
Some of the next articles are maybe not open access.

From Feasible Proofs to Feasible Computations

2010
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational information about the theorem being proved. This includes extracting feasible algorithms, deterministic or interactive, for witnessing an existential quantifier, a uniform ...
openaire   +2 more sources

Feasibility pump 2.0

Mathematical Programming Computation, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
FISCHETTI, MATTEO, SALVAGNIN, DOMENICO
openaire   +1 more source

Feasibility studies

IEEE Software, 1998
Is a cancelled project a bad project? After surveying about 8,000 IT projects, the Standish Group reported that about 30 percent of all projects were cancelled ("Charting the Seas of Information Technology", 1994). Capers Jones reports that the average cancelled project in the US is about a year behind schedule and has consumed 200 percent of its ...
openaire   +1 more source

On feasible numbers

1995
A formal approach to feasible numbers, as well as to middle and small numbers, is introduced, based on ideas of Parikh (1971) and improving his formalization. The “vague” set F of feasible numbers intuitively satisfies the axioms 0 ∈ F, F+1⊑F and 21000 ∉ F, where the latter is stronger than a condition considered by Parikh, and seems to be treated ...
openaire   +2 more sources

Feasibility of QoS for SMT

2004
Q4
Cazorla, F.J.   +5 more
openaire   +4 more sources

Semilinear Program Feasibility

2009
We study logical techniques for deciding the computational complexity of infinite-domain constraint satisfaction problems (CSPs). For the fundamental algebraic structure $\Gamma=(\mathbb R; L_1,L_2,\dots)$ where $\mathbb R$ are the real numbers and L 1 ,L 2 ,...
Manuel Bodirsky   +2 more
openaire   +2 more sources

Actual Arithmetic and Feasibility

2001
This paper presents a methodology for reasoning about the computational complexity of functional programs. We introduce a first order arithmetic $\StrictTa$ which is a syntactic restriction of Peano arithmetic. We establish that the set of functions which are provably total in $\StrictTa$, is exactly the set of polynomial time functions.The cut ...
openaire   +3 more sources

Feasibility and Ethics

American Journal of Respiratory and Critical Care Medicine, 2013
Price, David   +5 more
openaire   +3 more sources

Stochastic Constraints: How Feasible Is Feasible?

2023 Winter Simulation Conference (WSC), 2023
David J. Eckman   +2 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy