4,710,012 Hits in 4.7 sec

Completion of Choice [article]

Vasco Brattka, Guido Gherardi
2020 arXiv   pre-print
We systematically study the completion of choice problems in the Weihrauch lattice. Choice problems play a pivotal role in Weihrauch complexity.  ...  Hence, studying the completion of choice problems allows us to study simultaneously choice problems in the total Weihrauch lattice, as well as the question which choice problems can be made independent  ...  Let X, Y be complete computable metric spaces By [2, Theorem 7.7] the first given condition is exactly satisfied for the effectively Borel measurable functions f . Question 11.8.  ... 
arXiv:1910.13186v3 fatcat:iqhdmpj7irb43iol3uqs42gcsy

Choice number of some complete multi-partite graphs

Hikoe Enomoto, Kyoji Ohba, Katsuhiro Ota, Junko Sakamoto
2002 Discrete Mathematics  
Motivated by this, we investigate the choice numbers of some complete k-partite graphs of order slightly larger than 2k, and settle the conjecture for some special cases.  ...  We also present several complete multi-partite graphs whose choice numbers are not equal to their chromatic numbers.  ...  The choice number of the complete k-partite graph K(2; : : : ; 2) is equal to k.  ... 
doi:10.1016/s0012-365x(01)00059-0 fatcat:rsjxoatqpnh2nlcl47pcdshmkm

On-Line Choice Number of Complete Multipartite Graphs: an Algorithmic Approach [article]

Fei-Huang Chang, Hong-Bin Chen, Jun-Yi Guo, Yu-Pei Huang
2014 arXiv   pre-print
chromatic-choosable. (2) If |V(G)|≤m^2-m+2/m^2-3m+4χ(G), then G is on-line chromatic-choosable. (3) The on-line choice number of regular complete multipartite graphs K_m k is at most (m+1/2-√(2m-2))k for  ...  This paper studies the on-line choice number on complete multipartite graphs with independence number m. We give a unified strategy for every prescribed m.  ...  (G), then G is on-line chromatic-choosable.(3) The on-line choice number of regular complete multipartite graphs K m⋆k is at most m + 1 2 − √ 2m − 2 k for m ≥ 3.  ... 
arXiv:1305.2700v2 fatcat:bkf4tysjsrbntdu74jn34bpyo4

Completeness of a Branching-Time Logic with Possible Choices

Roberto Ciuni, Alberto Zanardo
2010 Studia Logica: An International Journal for Symbolic Logic  
of agent at a moment-individuated as sets of next moments -partition the set of next moments. 7 Examples of such a use are [3] and [4]. 8 A distributed system is a set of different programs connected  ...  paper we present BTC, which is a logic for branching-time whose modal operator quantifies over histories and temporal operators involves a restricted quantification over histories in a given possible choice  ...  In this paper, we present such a logic, which we call BTC (Branching-Time with Choices), and we show that BTC is complete w.r.t. choice b-trees, a new class of structures we shall introduce below.  ... 
doi:10.1007/s11225-010-9291-1 fatcat:omnoo4edsrhxfhlzxc3ycgpcwm

On the asymptotic value of the choice number of complete multi-partite graphs [article]

Nurit Gazit, Michael Krivelevich
2004 arXiv   pre-print
We calculate the asymptotic value of the choice number of complete multi-partite graphs.  ...  In this paper we calculate the asymptotic value of the choice number of a general complete bipartite graph K n 0 ,n 1 and then expand the result to the case of a complete multi-partite graph.  ...  It is also shown in [1] that the choice number of the complete bipartite graph K n,n satisfies ch(K n,n ) = (1 + o(1)) log 2 n.  ... 
arXiv:math/0409134v1 fatcat:mw7wwdco7feadcbj3vzrxwdhtu

On the choice number of complete multipartite graphs with part size four [article]

H. A. Kierstead, Andrew Salmon, Ran Wang
2014 arXiv   pre-print
Let ch(G) denote the choice number of a graph G, and let K_s*k be the complete k-partite graph with s vertices in each part.  ...  Erdős, Rubin, and Taylor showed that ch( K_2*k)=k, and suggested the problem of determining the choice number of K_s*k. The first author established ch( K_3*k)=4k-1/3. Here we prove ch (K_4*k)=3k-1/2.  ...  [2] suggested determining the choice number of uniform complete multipartite graphs.  ... 
arXiv:1407.3817v1 fatcat:ouewxvwk6ngjxleik532xyknqq

Children's colour choices for completing drawings of affectively characterised topics

Esther Burkitt, Martyn Barrett, Alyson Davis
2003 Journal of Child Psychology and Psychiatry and Allied Disciplines  
The children completed two test sessions in counterbalanced order. In one session, children rated and ranked ten colours in order of preference.  ...  This study was designed to explore whether or not children systematically use particular colours when completing drawings of affectively characterised topics.  ...  The drawings 18 of the tree indicated less variation of colour choice than the groups completing the models of men and dogs.  ... 
doi:10.1111/1469-7610.00134 pmid:12635973 fatcat:bz3i6fyhibds7dhuhsy3lxk53u

The Effects of Assignment Format and Choice on Task Completion

Youjia Hua, David Lee, Samuel Stansbery, James McAfee
2014 Journal of Education and Learning  
The results also suggest that the effectiveness of choice making depends on the relative discrepant preference levels of the choice alternatives.  ...  In the context of an alternating treatment design, the results showed that task presentation format may influence student preference and may be a promising choice alternative teachers can provide.  ...  of task completion.  ... 
doi:10.5539/jel.v3n1p101 fatcat:jrxgvfeq6recnnrg7lcqig7nsu

Staged Complete Revascularization in ST-Segment Elevation Myocardial Infarction Should Be the Treatment of Choice Compared to Primary Complete Revascularization

Do-Sun Lim
2011 Korean Circulation Journal  
Based on available data, PCI of the culprit lesion has the advantages of shorter procedure duration, a smaller amount of dye used, and a lower rate of periprocedural myocardial infarctions, while complete  ...  only or a strategy of complete revascularization, either in a simultaneous or staged multivessel PCI approach, will improve outcome.  ...  of staged complete revascularization appears to be the best choice.  ... 
doi:10.4070/kcj.2011.41.12.703 pmid:22259599 pmcid:PMC3257452 fatcat:ycp5inz65fcttftezrerv5yhdi

Complete characterization of functions satisfying the conditions of Arrow's theorem

Elchanan Mossel, Omer Tamuz
2011 Social Choice and Welfare  
Thus Arrow's theorem, in the case of non-strict preferences, does not provide a complete characterization of all social choice functions satisfying Transitivity, the Pareto Principle, and IIA.  ...  Arrow's theorem implies that a social choice function satisfying Transitivity, the Pareto Principle (Unanimity) and Independence of Irrelevant Alternatives (IIA) must be dictatorial.  ...  However, in the general case of non-strict preferences "If the dictator is indifferent between x and y, presumably he will then leave the choice up to some or all of the other members of society," in the  ... 
doi:10.1007/s00355-011-0547-0 fatcat:lp77zv23g5chxkyc6vit3b576y

The simplest complete model of choice response time: Linear ballistic accumulation

Scott D. Brown, Andrew Heathcote
2008 Cognitive Psychology  
The simplicity of the model allows complete analytic solutions for choices between any number of alternatives.  ...  The LBA is simpler than other models of choice response time, with independent accumulators that race towards a common response threshold.  ...  The LBA model, on the other hand, is proposed as a complete model of choice RT-we maintain that the model, while simple, can account for all of the important empirical phenomena.  ... 
doi:10.1016/j.cogpsych.2007.12.002 pmid:18243170 fatcat:led2mn5ulfhjpmvx6ljvpr5r7m

The best choice problem for posets; colored complete binary trees

Wojciech Kaźmierczak
2014 Journal of combinatorial optimization  
We consider the poset version of the secretary problem for rooted complete binary trees of a given length n where the 2 n−a complete binary trees whose roots are at the level a + 1 (counting from the leaves  ...  Open Access This article is distributed under the terms of the Creative Commons Attribution License which permits any use, distribution, and reproduction in any medium, provided the original author(s)  ...  In this section we will define a stopping time τ 0 for our best choice problem for CCBT m n .  ... 
doi:10.1007/s10878-014-9705-5 fatcat:73jnabuq2nbpfkc75f3gq7y4qq

PSPACE-Completeness of the Soundness Problem of Safe Asymmetric-Choice Workflow Nets [chapter]

Guanjun Liu
2020 Lecture Notes in Computer Science  
Asymmetric-choice workflow nets (ACWF-nets) are an important subclass of workflow nets (WF-nets) that can model and analyse business processes of many systems, especially the interactions among multiple  ...  Based on our reduction, we easily prove that the liveness problem of safe AC-nets is also PSPACE-complete, but the best result on this problem was NP-hardness provided by Ohta and Tsuji.  ...  The author would like to thank the anonymous reviewers for their very detailed and constructive comments that help the author improve the quality of this paper. This  ... 
doi:10.1007/978-3-030-51831-8_10 fatcat:5gsrxkdcfvactgdxfm5dgxn2ze

Completion time and performance on multiple-choice and essay tests

Paul W. Foos
1989 Bulletin of the Psychonomic Society  
The relationship between the order in which students completed multiple-choice or essay tests and their scores on those tests was examined; no significant relationship was found .  ...  One cannot successfully predict a student's test score by knowing when the student completed the test. RESULTS essay test. Both tests covered the same material presentedby the same instructor.  ...  of completion and scores on multiple-choice or essaytests.  ... 
doi:10.3758/bf03329933 fatcat:s42pgdfk6zcnrnk5e4txpvedlu

The complete removal of individual uncertainty: multiple optimal choices and random exchange economies

Yeneng Sun
1999 Economic Theory  
These results allow the complete removal of individual risks or uncertainty in economic models where non-unique best choices are inevitable.  ...  other versions of the law of large numbers in terms of integration of correspondences.  ...  These results allow the complete removal of individual risks or uncertainty in economic models where non-unique best choices are inevitable.  ... 
doi:10.1007/s001990050338 fatcat:mb62qql2xve5ja33dvxmnjzjti
« Previous Showing results 1 — 15 out of 4,710,012 results