نتایج جستجو برای: lin kernigan algorithm

تعداد نتایج: 763587  

1993
Yi-Bing Lin Bruno R. Preiss Wayne M. Loucks Edward D. Lazowska

In Time Warp parallel simulation, a process executes every message as soon as it arrives. If a message with a smaller timestamp subsequently arrives, the process rolls back its state to the time of the earlier message and re-executes from that point. Clearly, the state of each process must be saved (checkpointed) regularly in case a rollback is necessary. Although most existing Time Warp implem...

2008
Ming YUAN M. YUAN

In this article, I propose an efficient algorithm to compute `1 regularized maximum likelihood estimates in the Gaussian graphical model. These estimators, recently proposed in an earlier article by Yuan and Lin, conduct parameter estimation and model selection simultaneously and have been shown to enjoy nice properties in both large and finite samples. To compute the estimates, however, can be...

Journal: :American Journal of Public Health 2016

Journal: :Physical Review Letters 2012

2007
Inger Karlsson

Dynamic variations of the voice source in speech have been studied for a female speaker. The speech material consisted of syllables and sentences with varying stress patterns. The speech signal was inverse filtered and then a parameter model of the voice source was fitted as closely as possible to the inverse filtered glottal pulses. The four parameter glottal source model, the LF-model, was us...

2013
Iddo Tzameret

We formalize a combinatorial principle, called the 3XOR principle, due to Feige, Kim and Ofek [14], as a family of unsatisfiable propositional formulas for which refutations of small size in any propositional proof system that possesses the feasible interpolation property imply an efficient deterministic refutation algorithm for random 3SAT with n variables and Ω(n) clauses. Such small size ref...

2011
Max Hinne Elena Marchiori

We investigate the usage of Ant Colony Optimization to detect balanced graph cuts. In order to do so we develop an algorithm based on competing ant colonies. We use a heuristic from social network analysis called the edge clustering coefficient, which greatly helps our colonies in local search. The algorithm is able to detect cuts that correspond very well to known cuts on small real-world netw...

Journal: :Acta chimica Slovenica 2010
Ana Tušek Zelimir Kurtanjek

Mathematical models of dynamics of metabolic pathways are used for analysis of complex regulations of biochemical reactions as an intrinsic property of a metabolism. The models are derived under assumptions of kinetic rate functions and usually result in simplification in view of the model theoretical scope and/or its practical application. The main obstacle in kinetic modeling is the dimension...

Journal: :Electronic Colloquium on Computational Complexity (ECCC) 2013
Iddo Tzameret

We formalize a combinatorial principle, called the 3XOR principle, due to Feige, Kim and Ofek [FKO06], as a family of unsatisfiable propositional formulas for which refutations of small size in any propositional proof system that possesses the feasible interpolation property imply an efficient deterministic refutation algorithm for random 3SAT with n variables and Ω(n) clauses. Such small size ...

2001
Yi-Bing Lin Bruno R. Preiss Wayne M. Loucks Edward D. Lazowska

In Time Warp parallel simulation, a process executes every message as soon as it arrives. If a message with a smaller timestamp subsequently arrives, the process rolls back its state to the time of the earlier message and re-executes from that point. Clearly, the state of each process must be saved (checkpointed) regularly in case a rollback is necessary. Although most existing Time Warp implem...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید