A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
Weakly maximal decidable structures

2008
*
RAIRO - Theoretical Informatics and Applications
*

We prove that there exists a

doi:10.1051/ita:2007044
fatcat:n3zufzgtuzeenfpnou5hl3f33i
*structure*M whose monadic second order theory is*decidable*, and such that the first-order theory of every expansion of M by a constant is undecidable. ... A*weakly**maximal**decidable**structure*We state now the main result of the paper. Proof. Let us state first the main lines of the proof. ... Introduction In [3] , Elgot and Rabin ask whether there exist*maximal**decidable**structures*, i.e.*structures*M whose first-order theory is*decidable*and such that the first-order theory of any expansion ...##
###
Page 7033 of Mathematical Reviews Vol. , Issue 94m
[page]

1994
*
Mathematical Reviews
*

G of S, and (3) R[G] is left

*weakly*regular for each*maximal*subgroup of G. ... “The basic*structure*of the paper is as follows. ...##
###
Net-structure-based conditions to decide compatibility and weak compatibility for a class of inter-organizational workflow nets

2015
*
Science China Information Sciences
*

Necessary and sufficient conditions are proposed to

doi:10.1007/s11432-014-5259-5
fatcat:i7gxr4xxsze5hc7274isscyl54
*decide*compatibility and weak compatibility. These conditions are based on the net*structures*only. ... Necessary and sufficient conditions are presented to*decide*compatibility and weak compatibility for this class, and they are dependent on the net*structures*only. ... Corollary 2 . 2 An SCIWF-net is*weakly*compatible if and only if each*maximal*cap is a T-component. ...##
###
Page 1841 of Mathematical Reviews Vol. , Issue 83e
[page]

1983
*
Mathematical Reviews
*

Using a representation of

*maximal*outerplanar graphs as series of irreducible fractions, efficient algorithms for*deciding*isomorphism of*maximal*outerplanar graphs and for*deciding*whether one*maximal*... Kh. 83e:05053 A chromatic polynomial and*structures*of graphs. (Russian. Azerbaijani and English summaries) Izv. Akad. Nauk Azerbaidzhan. SSR Ser. Fiz.-Tekhn. Mat. Nauk 2 (1981), no. 3, 90-93. ...##
###
A unifying theory of control dependence and its application to arbitrary program structures

2011
*
Theoretical Computer Science
*

These are defined for all finite directed graphs, not just control flow graphs and are hence allow control dependence to be applied to a wider class of program

doi:10.1016/j.tcs.2011.08.033
fatcat:pvuv4xisdbgpfdx2hwaxdxgjaa
*structures*than before. ... Low polynomial-time algorithms for producing minimal*weakly*and strongly control-closed sets over generalised control flow graphs are given. ... In order to do this we need the concept of a*weakly**deciding*vertex. Informally, a vertex is*weakly**deciding*over a set V ′ if it*decides*between any two vertices in V ′ . ...##
###
What Drives Failure to Maximize Payoffs in the Lab? A Test of the Inequality Aversion Hypothesis

2011
*
Social Science Research Network
*

In experiments based on the Beard and Beil (1994) game, second movers very often fail to select the decision that

doi:10.2139/ssrn.1895287
fatcat:eyrv3a4hzncwffcuqspbekwrwu
*maximizes*both players payoff. ... , in which case the second mover only has to*decide*whether to*maximize*both players' payoff or not. ... But since the first mover looses a lot should the second mover fail to*maximize*payoffs, a very likely issue is the Pareto dominated one in which the first mover*decides*alone. ...##
###
A resolution decision procedure for the guarded fragment
[chapter]

1998
*
Lecture Notes in Computer Science
*

By constructing an effective decision procedure for the guarded fragment we define an effective procedure for

doi:10.1007/bfb0054260
fatcat:mcex3fmv65d4pmz75ja2xo57ly
*deciding*these modal logics. C. Kirchner and H. ... Theorem 1 states that when two*weakly*covering literals are unified, the*maximal*depth of a variable does not grow. ... If a clause c contains non-ground functional terms, then the literals with*maximal*Vardepth are*maximal*. Otherwise at least the guard is*maximal*. ...##
###
Decidable models of small theories

2015
*
Lobachevskii Journal of Mathematics
*

The prime model of a

doi:10.1134/s1995080215040198
fatcat:3ysb4eep6re6phvz6v3ojphrmi
*decidable*small theory is not necessarily*decidable*. The saturated model of a hereditarily*decidable*small theory is not necessarily*decidable*. ... A homogeneous model with uniformly*decidable*type spectra is not necessarily*decidable*. ... A*structure*is*weakly*limit if it is the union of an elementary chain of almost prime*structures*. ...##
###
Economics of B2C Sharing Platforms

2016
*
International Conference on Information Systems
*

The

dblp:conf/icis/ProvinAZ16
fatcat:wted444qczamxoxuldnqn2p4tq
*structure*of our model is related to that of Brock and Evans (1985) where individual entrepreneurs make production decisions and a policy maker*decides*on a tax schedule to*maximize*welfare. ... Second, the monopoly B2C sharing platform*decides*on its pricing scheme to*maximize*profits. Third, producers*decide*on whether to share or sell their produced durable goods to*maximize*profits. ...##
###
Hard Instances of Hard Problems
[chapter]

2000
*
Lecture Notes in Computer Science
*

It follows that every

doi:10.1007/3-540-46541-3_27
fatcat:elpvu2olbzcclfgtrxnjxvy22y
*weakly*hard problem has a dense set of such*maximally*hard instances. ... This paper investigates the instance complexities of problems that are hard or*weakly*hard for exponential time under polynomial time, many-one reductions. ... Thus*weakly*hard problems can have essentially*maximal*complexity at almost every instance. ...##
###
Computing weakly reversible realizations of chemical reaction networks
[article]

2011
*
arXiv
*
pre-print

An algorithm is given in this paper for the computation of dynamically equivalent

arXiv:1103.2892v2
fatcat:62ujrc7ewrb73e6yfmufge57yy
*weakly*reversible realizations with the*maximal*number of reactions, for chemical reaction networks (CRNs) with mass action ... The algorithm computes a*maximal*superstructure that contains all other possible*weakly*reversible*structures*as proper subgraphs, and it is able to determine if no*weakly*reversible realization exists ... The algorithm for computing*weakly*reversible realizations We recall that a dense realization of a CRN contains the*maximal*number of reactions (i.e.*maximal*number of nonzero off-diagonal elements in ...##
###
On Verification of Linear Occurrence Properties of Real-Time Systems

2008
*
Electronical Notes in Theoretical Computer Science
*

Duration Calculus of

doi:10.1016/j.entcs.2008.03.088
fatcat:qhwxpctn55bkdbmwpx4zbfc7pi
*Weakly*Monotonic Time (WDC) is an extension of DC to allow description of discrete processes where several steps of computation can occur at the same time point. ... For each infinite path ω of a probabilistic timed*structure*M, the set W T ω = { (k, t) | (i, t ) ∈ P os(ω), k = i and t = D ω (i, t ) } is a*weakly*monotonic time frame. ... Given a probabilistic timed*structure*M and a WDC formula Ψ. Let q be a state of M and [τ 1 , τ 2 ] be a*weakly*monotonic time interval [τ 1 , τ 2 ] of ω ∈ P ath inf (q). ...##
###
Page 4395 of Mathematical Reviews Vol. , Issue 2001G
[page]

2001
*
Mathematical Reviews
*

It is proved that for the theory of equality and the theory of dense linear order without minimal and

*maximal*elements /(7')) is*decidable*, but cannot be axiomatized by any set of schemes with restricted ... (RS-MOSC; Moscow)*Decidable*first-order logics. (Russian. English and Russian summaries) Fundam. Prikl. Mat. 4 (1998), no. 2, 733-749. ...##
###
Page 3187 of Mathematical Reviews Vol. , Issue 2003e
[page]

2003
*
Mathematical Reviews
*

A theory is

*weakly*o-minimal if all of its models are*weakly*o-minimal. A*weakly*o-minimal*structure*is non-uniformly*weakly*o-minimal if its elementary theory is not*weakly*o-minimal. ... A totally ordered*structure*#@ = (M,<,...) is called*weakly*o- minimal if every definable subset of M is a finite union of convex disjoint sets. ...##
###
A Restricted-Weakly Connected Dominating Set for Role Assignment in a Multichannel MAC for Wireless Mesh Network

2009
*
2009 IEEE International Conference on Wireless and Mobile Computing, Networking and Communications
*

Then, we propose a centralized 2-approximation algorithm that

doi:10.1109/wimob.2009.37
dblp:conf/wimob/DartiesTD09
fatcat:iayq7vg6ivc4jgzgb4ju7n5g7a
*maximizes*the sum of radio link capacities in the molecular*structure*. ... We base our role assignment on a restricted*Weakly*Connected Dominating Set*structure*. After presenting a formal definition of the role assignment problem, we prove its NP-completeness. ... We can observe that*maximizing*the number of radio links in the molecular*structure*really improves the throughput of the*structure*. ...
« Previous

*Showing results 1 — 15 out of 65,202 results*