Filters








23,741 Hits in 7.4 sec

On the mutual-exclusion problem — a quest for minimal solutions

Uri Abraham, Menachem Magidor
1994 Theoretical Computer Science  
Magidor, On the mutual-exclusion problem -a quest for minimal solutions, Theoretical Computer Science 129 (1994) 1-38.  ...  For two processes, we show that there cannot be a solution to the critical-section problem if the two registers used are regular and of size 2 and 3.  ...  On thr mutual-exclusion problem a quest for minimal solutions 27 Before continuing, an intuitive overview of the proof is in place.  ... 
doi:10.1016/0304-3975(94)90079-5 fatcat:2wmv4iab6je2lp4ugpltaade3y

Author index volume 129 (1994)

1994 Theoretical Computer Science  
Magidor, On the mutual-exclusion problem -a quest for minimal solutions (Fundamental Study) Allouche, J.-P. and M.  ...  Lin, The computational complexity of the satisfiability of modal Horn clauses for modal propositional logics Delyon, B. and 0. Maler, On the effects of noise and speed on computations Deutz, A.H., A.  ... 
doi:10.1016/0304-3975(94)90039-6 fatcat:jom77qqd2bc53k356phknd4jg4

Page 5543 of Mathematical Reviews Vol. , Issue 95i [page]

1995 Mathematical Reviews  
Krishnamoorthy (1-RSP-C; Troy, NY) 95i:68054 68Q22 68Q10 68Q25 68Q68 Abraham, Uri (IL-BGUN-CS; Be‘ér Sheva‘); Magidor, Menachem (IL-HEBR-IM; Jerusalem) On the mutual-exclusion problema quest for minimal  ...  Solutions to the mutual exclusion problem deeply depend on the assumptions made on the environment: the kinds of communi- cation means that may be used and whether the processes are allowed to stop somewhere  ... 

The Congenial Talking Philosophers Problem in Computer Networks [chapter]

Yuh-Jzer Joung
1999 Lecture Notes in Computer Science  
The design issues for group mutual exclusion have been modeled as the Congenial Talking Philosophers problem, and solutions for shared-memory models have been proposed [12, 14] .  ...  We first present a solution that is a straightforward adaptation from Ricart and Agrawala's algorithm for ordinary mutual exclusion.  ...  The author would like to thank Kuen-Pin Wu, Wen-Jian Tsai, and Jen-Yi Liao for comments on the earlier work of this research.  ... 
doi:10.1007/3-540-48169-9_14 fatcat:smfhioeh6jcebmwofwhcp25wdy

The congenial talking philosophers problem in computer networks

Yuh-Jzer Joung
2002 Distributed computing  
The design issues for group mutual exclusion have been modeled as the Congenial Talking Philosophers problem, and solutions for shared-memory models have been proposed [12, 14] .  ...  We first present a solution that is a straightforward adaptation from Ricart and Agrawala's algorithm for ordinary mutual exclusion.  ...  The author would like to thank Kuen-Pin Wu, Wen-Jian Tsai, and Jen-Yi Liao for comments on the earlier work of this research.  ... 
doi:10.1007/s004460100069 fatcat:vfmxxn3evnc6dmdtipizbevolq

A Question Concerning Positive Type Polynomials

Henry Teicher
1959 Proceedings of the American Mathematical Society  
the coefficients of (x2 -x + e)~1Pm(x). "', J"') is a real solution and among all real solutions conforming to (i), it is the one having minimal e.  ...  To this end, we distinguish, via (2.5), three mutually exclusive and exhaustive possibilities: Since we are concerned only with the possibility of solutions with smaller e, we assume in what follows that  ... 
doi:10.2307/2032872 fatcat:ec2eyjuddvhfrjn6byatqyvequ

A question concerning positive type polynomials

Henry Teicher
1959 Proceedings of the American Mathematical Society  
the coefficients of (x2 -x + e)~1Pm(x). "', J"') is a real solution and among all real solutions conforming to (i), it is the one having minimal e.  ...  To this end, we distinguish, via (2.5), three mutually exclusive and exhaustive possibilities: Since we are concerned only with the possibility of solutions with smaller e, we assume in what follows that  ... 
doi:10.1090/s0002-9939-1959-0105473-6 fatcat:3pkkm3rhm5bxpjnen43k6jk43y

Page 359 of American Anthropologist Vol. 87, Issue 4 [page]

1985 American Anthropologist  
Riches does not deny that the two approaches may be complementary rather than mutually exclusive but confesses to being skeptical that deep, unconscious forces exist as a determinant of human behav- ior  ...  pro- viding some sort of solution to too many hunt- ers showing up at the same site, for whatever reasons.  ... 

Mutuality as an antidote to rent-seekingShariah arbitrage in Islamic finance

Mahmoud A. El-Gamal
2007 Thunderbird International Business Review  
An obvious solution is to adopt mutual structures for financial intermediaries of credit (e.g. banks) and risk (e.g. insurance companies), as early experiments in Islamic finance had apparently done.  ...  In this paper, I argue that mutuality should be given back its central role in our discourse on Islamic finance.  ...  A natural solution to this problem is for Islamic banks to adopt a mutual corporate structure.  ... 
doi:10.1002/tie.20139 fatcat:qgrnxlvuzfhdfbov4biel7ryni

Metrics for Developing Functional Requirements and Selecting Design Parameters in Axiomatic Design

Christopher A. Brown, Richard Henley
2016 Procedia CIRP  
Quantitative value chains, along with targeting and tolerancing chains, which start with the CNs, are proposed The use of adaptive designs, whereby a design solution can evolve to respond to changing circumstances  ...  The metrics and equations relating FRs to their parents and to the corresponding DPs can be useful for complying with the axioms and for verbalizing FRs.  ...  Machine Company in North Kingston, RI for supporting the study of the application of AD in managing a corporation.  ... 
doi:10.1016/j.procir.2016.08.045 fatcat:shafehpvqvhgnjw2vo6gn23ana

Page 8574 of Mathematical Reviews Vol. , Issue 2004k [page]

2004 Mathematical Reviews  
The quest for minimal models of varieties of dimension three and higher has been one of the fundamental problems in the classification of higher-dimensional varieties.  ...  Its solution has been one of the triumphs of Mori theory or, as it is also known, the minimal model program (MMP). For the web version of Mathematical Reviews, see http: //www.ams.org/mathscinet  ... 

Meeting Deadlines Cheaply

Julien Legriel, Oded Maler
2011 2011 23rd Euromicro Conference on Real-Time Systems  
We develop a computational framework for solving the problem of finding the cheapest configuration (in terms of the number of processors and their respective speeds) of a multiprocessor architecture on  ...  the problem as a bi-criteria optimization for which we approximate the Pareto front.  ...  We thank Bruno Jego and Gilbert Richard for explaining us the XSTREAM architecture, Aldric Degorre for discussions on periodic scheduling and Scott Cotton for his advice on SAT and SMT.  ... 
doi:10.1109/ecrts.2011.25 dblp:conf/ecrts/LegrielM11 fatcat:fk4tz52pofbwlnigehpza2cepi

Optimal Planning of Multitype DGs and D-STATCOMs in Power Distribution Network Using an Efficient Parameter Free Metaheuristic Algorithm

Subrat Kumar Dash, Sivkumar Mishra, Almoataz Youssef Abdelaziz, Junhee Hong, Zong Woo Geem
2022 Energies  
In a quest to solve the multi-objective optimal planning problem using a simple parameter-free metaheuristic algorithm, this paper establishes the recently proposed student psychology-based optimization  ...  A novel multi-objective framework (with suitable weights) is proposed with a real power loss minimization index, bus voltage variation minimization index, system voltage stability maximization index, and  ...  Conflicts of Interest: The authors declare no conflict of interest.  ... 
doi:10.3390/en15093433 fatcat:vxnyssi7pbbexbevnodrsrr6xi

A priority-based distributed group mutual exclusion algorithm when group access is non-uniform

Neeraj Mittal, Prajwal K. Mohan
2007 Journal of Parallel and Distributed Computing  
In the group mutual exclusion problem, each critical section has a type or a group associated with it.  ...  Most algorithms for solving the group mutual exclusion problem that have been proposed so far in the literature treat all groups equally.  ...  Clearly, any algorithm for solving the traditional mutual exclusion problem also solves the group mutual exclusion problem.  ... 
doi:10.1016/j.jpdc.2007.02.005 fatcat:msodhc2fqfe2tkfismufquo4s4

Distributed Enterprises Configuration: Orders Allocation Within Networks of Firms [chapter]

Abdelkader Hammami, Patrick Burlat, Xavier Boucher
2002 IFIP Advances in Information and Communication Technology  
The order allocation procedure is first based on a product description (focusing on required activities and competencies), and second on the identification of the available competencies within networks  ...  This paper describes a case study about an order allocation method for networks of firms.  ...  These types of network are not mutually exclusive. For example, a group may correspond at the same time to a production network and a purchasing network.  ... 
doi:10.1007/978-0-387-35585-6_24 fatcat:zw37aegpafgvrfihmvhyotijii
« Previous Showing results 1 — 15 out of 23,741 results