A linear programming-based heuristic procedure for solving Multiple choice Programming (MCP) problems is presented. Two pivot schemes which may be viewed as the specialized versions of those in “Pivot and Complement”, an &icicnt heuristic by Balas and Martin for pure O-l programming, are inuxporatai into the procedure along with the additional features of cut generation, variable fixing and uch...

Derivations in the minimalist programm (MP) frequently encounter competition between elementary operations. A way in MP to resolve such competitions is to assume preference principles, the most prominent being “Merge before Move” (Chomsky 2000). Assmann, Georgi et al. (2013) discuss competition between Agree and Move. ere, either Agree must be procrastinated in favor of Move or the other way ro...

Progressive Pruning (PP) is used in the Monte-Carlo go playing program Indigo. For each candidate move, PP launches random games starting with this move. PP gathers statistics on moves, and it prunes moves statistically inferior to the best one [5]. This papers yields two new pruning techniques: Miai Pruning (MP) and Set Pruning (SP). In MP the second move of the random games is selected at ran...

In this paper, we propose the necessity to expand the concept of semiformal systems in collaborative environments. We have through extensive empirical work identified a number of salient dimensions that points towards need of broaden the space of possible actions for the users. The complexity of collaborative processes and the trend of increased use of mobile technologies have been concretized ...

An exact formula for the move-to-front rule for self-organizing lists.

Consider a list of n files whose popularities are random. These files are updated according to the move-tofront rule and we consider the induced Markov chain at equilibrium. We give the exact limiting distribution of the search-cost per item as n tends to infinity. Some examples are supplied.

Yasutaka Nakanishi asked in 1981 whether a 3–move is an unknotting operation. In Kirby’s problem list, this question is called The Montesinos–Nakanishi 3– move conjecture. We define the nth Burnside group of a link and use the 3rd Burnside group to answer Nakanishi’s question; ie, we show that some links cannot be reduced to trivial links by 3–moves. AMS Classification numbers Primary: 57M27 Se...

The present paper investigated the effect of teacher’s follow‐up move approach on Iranian EFL learners’ conversation quality. Ninety students were selected in a senior high school in Poldokhtar, Iran. Through an oral test sixty out of ninety students whose scores were between one standard deviation (SD) above and below the mean were selected as the participants of the study. Then they were divi...