Results 1  10
of
299
Partitioning by Iterative Deletion
, 1999
"... Netlist partitioning is an important and well studied problem. In this paper, a linear time partitioning approach based on iterative deletion is presented. We use the partitioning problem to allow a fair comparison of the iterative deletion approach with well known iterative improvement methods. For ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
Netlist partitioning is an important and well studied problem. In this paper, a linear time partitioning approach based on iterative deletion is presented. We use the partitioning problem to allow a fair comparison of the iterative deletion approach with well known iterative improvement methods
Multiple Class GNetworks with iterated deletions
, 1997
"... We present a new type of multiclass generalized networks of queues with a steadystate product form solution. At its arrival into a queue, a negative customer (or a signal) starts an iteration. At each step of the iteration, a customer is deleted according to a probability which may depend on the ty ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We present a new type of multiclass generalized networks of queues with a steadystate product form solution. At its arrival into a queue, a negative customer (or a signal) starts an iteration. At each step of the iteration, a customer is deleted according to a probability which may depend
SPID4.5: A Selective Pseudo Iterative Deletion Discretization Algorithm for Machine Learning, Uncertain Reasoning & Pattern Recognition
"... Many machine learning algorithms developed for classification, prediction and uncertain reasoning cannot handle continuous features. To use them on real world data sets, continuous attributes must be discretized into small number of distinct ranges. Also discretization provides an insight into criti ..."
Abstract
 Add to MetaCart
into critical values in continuous attributes. In this work (SPID4.5), an improvement of our previously published work SPID3, we iteratively compute pseudo deletion count at each boundary point of all continuous attributes and accept threshold points which reduce noise in the database most. The successive
Iterated Dominance Revisited∗
, 2011
"... Iterated deletion of strongly dominated strategies has a long tradition in game theory, going ..."
Abstract
 Add to MetaCart
Iterated deletion of strongly dominated strategies has a long tradition in game theory, going
On Iterated Scattered Deletion
"... Ito et al. [2] asked whether the regular languages are closed under (;) . We show that they are not. Let k 2 be arbitrary, and let \Sigma k = fff i ; fi i ; fl i ; j i g i=1 . Then we define L k ` \Sigma as L k = (ff i fi i ) (fl i j i ) fi i j i : We claim that (L k ) ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Ito et al. [2] asked whether the regular languages are closed under (;) . We show that they are not. Let k 2 be arbitrary, and let \Sigma k = fff i ; fi i ; fl i ; j i g i=1 . Then we define L k ` \Sigma as L k = (ff i fi i ) (fl i j i ) fi i j i : We claim that (L k ) " i = fff 1 fl 2 \Delta \Delta \Delta fl k : i j 1g: (1) and that (;) (L k ) cannot be expressed as the intersection of k \Gamma 1 contextfree languages. We first establish (1). Let (i 1 ; i 2 ; \Delta \Delta \Delta ; i k ) 2 N . Then note that j 2 (\Delta \Delta \Delta ( (ff j fi j ) (fl j j j ) )[;] fi 1 j 1 ) \Delta \Delta \Delta)[;] fi k j k : This establishes the righttoleft inclusion of (1). We now show the reverse inclusion. First, note that if ff 2 (;) (L k ), then we can write ff = x 1 x 2 \Delta \Delta \Delta x k y 1 y 2 \Delta \Delta \Delta y k where x i 2 fff i ; fi i g and y i 2 ffl i ; j i g . To p
Thinning methodologies−a comprehensive survey
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 1992
"... AbstractThis article is a comprehensive survey of thinning methodologies. It discusses the wide range of thinning algorithms, including iterative deletion of pixels and nonpixelbased methods, whereas skeletonization algorithms based on medial axis and other distance transforms will be the subject ..."
Abstract

Cited by 154 (2 self)
 Add to MetaCart
AbstractThis article is a comprehensive survey of thinning methodologies. It discusses the wide range of thinning algorithms, including iterative deletion of pixels and nonpixelbased methods, whereas skeletonization algorithms based on medial axis and other distance transforms will be the subject
Iterated Regret Minimization: A New Solution Concept
"... For some wellknown games, such as the Traveler’s Dilemma or the Centipede Game, traditional gametheoretic solution concepts—most notably Nash equilibrium—predict outcomes that are not consistent with empirical observations. We introduce a new solution concept, iterated regret minimization, which ex ..."
Abstract

Cited by 27 (2 self)
 Add to MetaCart
exhibits the same qualitative behavior as that observed in experiments in many games of interest, including Traveler’s Dilemma, the Centipede Game, Nash bargaining, and Bertrand competition. As the name suggests, iterated regret minimization involves the iterated deletion of strategies that do not minimize
Iterative Dominance and Sequential Bargaining
, 2004
"... A new game theoretic analysis of finite horizon, complete information bargaining is advanced. The extensive form reflects an attempt to model unstructured negotiations, in which the negotiants can gain no artificial advantage from the details of the bargaining protocol. Conditions are identified und ..."
Abstract
 Add to MetaCart
under which the game is dominance solvable in the sense that iterative deletion of weakly dominated strategies selects a unique outcome. These conditions serve to preclude embedded static bargaining problems of the sort that have historically been deemed indeterminate, thereby ensuring that the dynamic
A Logical Characterization of Iterated Admissibility
"... Brandenburger, Friedenberg, and Keisler provide an epistemic characterization of iterated admissibility (i.e., iterated deletion of weakly dominated strategies) where uncertainty is represented using LPSs (lexicographic probability sequences). Their characterization holds in a rich structure called ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
Brandenburger, Friedenberg, and Keisler provide an epistemic characterization of iterated admissibility (i.e., iterated deletion of weakly dominated strategies) where uncertainty is represented using LPSs (lexicographic probability sequences). Their characterization holds in a rich structure called
Multiple Class GNetworks with List Oriented Deletions
, 1998
"... We study a new dynamic of generalized networks of queues. We consider networks with multiple classes of customers and signals, and three types of service disciplines: FIFO, LIFO/PR and Processor Sharing. Moreover, we consider a probabilistic deleting mechanism based on iterated deletions of customer ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We study a new dynamic of generalized networks of queues. We consider networks with multiple classes of customers and signals, and three types of service disciplines: FIFO, LIFO/PR and Processor Sharing. Moreover, we consider a probabilistic deleting mechanism based on iterated deletions
Results 1  10
of
299