Výsledky vyhledávání - Analysis of Algorithms: Computational Complexity

Multilevel Monte Carlo Path Simulation Autor Giles, Michael B

“…We show that multigrid ideas can be used to reduce the computational complexity of estimating an expected value arising from a stochastic differential equation using Monte Carlo path simulations…”
Získat plný text

A Column Generation Algorithm for Choice-Based Network Revenue Management Autor Bront, Juan Jose Miranda, Mendez-Diaz, Isabel, Vulcano, Gustavo

“… This extension involves both modeling and computational challenges. One way to describe choice behavior is to assume that each customer belongs to a segment , which is characterized by a consideration set , i.e…”
Získat plný text

Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction Autor Pisinger, W. David, Rasmussen, Anders Bo, Sandvik, Rune

“… All coefficients are assumed to be nonnegative and all decision variables are binary. A new exact algorithm is presented, which makes use of aggressive reduction techniques to decrease the size of the instance to a manageable size…”
Získat plný text

An Analysis of Pediatric Vaccine Formulary Selection Problems Autor Hall, Shane N, Jacobson, Sheldon H, Sewell, Edward C

“…Vaccination against infectious disease is hailed as one of the great achievements in public health. However, the United States Recommended Childhood…”
Získat plný text

A Quantum Hamiltonian Identification Algorithm: Computational Complexity and Error Analysis Autor Yuanlong Wang, Daoyi Dong, Bo Qi, Jun Zhang, Petersen, Ian R., Yonezawa, Hidehiro

“… The Hamiltonian identification method has computational complexity O(d 6 ), where d is the dimension of the system Hamiltonian…”
Získat plný text

On the Effectiveness of Zero-Inventory-Ordering Policies for the Economic Lot-Sizing Model with a Class of Piecewise Linear Cost Structures Autor Chan, Lap Mui Ann, Muriel, Ana, Shen, Zuo-Jun, Simchi-Levi, David

“…We consider an economic lot-sizing problem with a special class of piecewise linear ordering costs, which we refer to as the class of modified all-unit…”
Získat plný text

Denser Packings Obtained in O(n log log n) Time Autor Pisinger, David

“… constraint graph, but interpret the sequences as a packing order in a constructive algorithm…”
Získat plný text

Computing shortest paths for transportation of hazardous materials in continuous spaces Autor Díaz-Báñez, J.M., Gómez, F., Toussaint, G.T.

“… maximized. We propose an approximate algorithm based on the bisection…”
Získat plný text

Heuristic and Special Case Algorithms for Dispersion Problems Autor Ravi, S. S, Rosenkrantz, D. J, Tayi, G. K

“… ). We consider the question of obtaining near-optimal solutions. for MAX-MIN , we show that if the distances do not satisfy the triangle inequality, there is no polynomial-time relative approximation algorithm unless P = NP…”
Získat plný text

Computational Complexity Analysis of Ant Colony Clustering Algorithms: Application to Student's Grouping Problem Autor Chniter, Malak, Abid, Abir, Kallel, Ilhem, Kanoun, Slim

“… As a consequence, determining the computational cost of these algorithms is one of the most interesting tasks in the quest for optimal clustering solutions in a real-time system…”
Získat plný text

Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops Autor Glass, C.A, Potts, C.N, Strusevich, V.A

“…In this paper, we study a problem of scheduling and batching on two machines in a flow-shop and open-shop environment. Each machine processes operations in…”
Získat plný text

Bioinformatics and Management Science: Some Common Tools and Techniques Autor Abbas, Ali E, Holmes, Susan P

“…In April of 2003, Science (2003) and Nature (2003) published special issues marking two significant achievements in the history of science: the 50th…”
Získat plný text

Multiple Sequence Alignment as a Facility-Location Problem Autor Just, Winfried, Vedova, Gianluca Della

“…A connection is made between certain multiple-sequence alignment problems and facility-location problems, and the existence of a PTAS (polynomial-time…”
Získat plný text

Tutorial on computational complexity Autor Tovey, Graig A

“…Computational complexity measures how much work is required to solve different problems…”
Získat plný text

A systematic analysis on performance and computational complexity of sorting algorithms Autor Sureshkumar Sundaramoorthy, Govardhan Karunanidhi

“… This review systematically evaluates the performance and computational complexity of twelve classical sorting techniques…”
Získat plný text

Computational complexity of swarm-based algorithms: a detailed analysis Autor María-Luisa Pérez-Delgado, Jesús-Ángel Román-Gallego

“… are. On the other hand, the literature on swarm-based algorithms does not usually include the analysis of computational complexity of the algorithms…”
Získat plný text

On the Logical Computational Complexity Analysis of Turbo Decoding Algorithms for the LTE Standards Autor Beeharry, Y., Fowdur, T. P., Soyjaudah, K. M. S.

“…Evaluating the computational complexity of decoders is a very important aspect in the area of Error Control Coding…”
Získat plný text

Computational Complexity Analysis of Arc Fault Detection Algorithms for Photovoltaic Systems Autor Fernandes, Arthur F. S., Da Silva, Joao A. F. G., Barros, Isaac M. S., de Oliveira, Luiz F. P., Barros, Tarcio A. S., Fantinato, Denis G.

“… Arc Fault Detection (AFD) algorithms are crucial for mitigating this danger. Although there are several AFD algorithms, their computational complexity…”
Získat plný text

A Comparative Analysis of Computational Complexity in Genetic Algorithm Variants: Evaluating Time and Space Trade-offs Autor Dr. Madhur Jain, Dr. Shilpi Jain, Avinash Kumar

“…; hence their differences concerning computational efficiency are extremely visible (Goldberg, 1989) [1]. This work aims to evaluate the computational complexity of the three GA variants…”
Získat plný text

Computational Complexity of Some Maximum Average Weight Problems with Precedence Constraints Autor Faigle, Ulrich, Kern, Walter

“… This paper investigates the computational complexity and shows that the general problem is NP-complete…”
Získat plný text