標(biāo)題: Titlebook: Approximation and Complexity in Numerical Optimization; Continuous and Discr Panos M. Pardalos Book 2000 Springer Science+Business Media Do [打印本頁] 作者: Lactase 時(shí)間: 2025-3-21 18:09
書目名稱Approximation and Complexity in Numerical Optimization影響因子(影響力)
書目名稱Approximation and Complexity in Numerical Optimization影響因子(影響力)學(xué)科排名
書目名稱Approximation and Complexity in Numerical Optimization網(wǎng)絡(luò)公開度
書目名稱Approximation and Complexity in Numerical Optimization網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Approximation and Complexity in Numerical Optimization被引頻次
書目名稱Approximation and Complexity in Numerical Optimization被引頻次學(xué)科排名
書目名稱Approximation and Complexity in Numerical Optimization年度引用
書目名稱Approximation and Complexity in Numerical Optimization年度引用學(xué)科排名
書目名稱Approximation and Complexity in Numerical Optimization讀者反饋
書目名稱Approximation and Complexity in Numerical Optimization讀者反饋學(xué)科排名
作者: cocoon 時(shí)間: 2025-3-21 23:22 作者: Recessive 時(shí)間: 2025-3-22 02:08
Diabetes, Insulin und Chirurgie,eer size of these data repositories brings with it interesting visualization and computational challenges. We introduce the notion of . as a metaphor that allows the integration of visualization and computation over these data sets. By using out-of-core algorithms we build a hierarchy of graph surfa作者: Keratectomy 時(shí)間: 2025-3-22 06:36
Diabetes, Insulin und Chirurgie,s, given a finite set . of points in the plane, search for a network interconnecting these points with minimal length. This shortest network must be a tree and is called a Steiner Minimal Tree (SMT). It may contain vertices different from the points which are to be connected. Such points are called 作者: Ancestor 時(shí)間: 2025-3-22 11:32
Ergebnisse der Chirurgie und Orthop?diere returning to the starting node. In this paper we solve the HCP via Markov chains and min-type functions. In addition, we present preliminary computational results with randomly generated graphs of moderate size.作者: 打火石 時(shí)間: 2025-3-22 15:57 作者: arousal 時(shí)間: 2025-3-22 18:24 作者: 帶來 時(shí)間: 2025-3-22 23:35 作者: lesion 時(shí)間: 2025-3-23 01:50 作者: neutrophils 時(shí)間: 2025-3-23 06:12
Ergebnisse der Chirurgie und Orthop?diethe hypergraph into a weighted (undirected) graph, and then solve it as a graph partition problem using the recent semidefinite program relaxation and heuristic or randomized approximation. Our preliminary computational results indicate that as the number of modules in the circuit increases, the qua作者: FILLY 時(shí)間: 2025-3-23 13:42
Ergebnisse der Chirurgie und Orthop?died here are motivated by the recent shift towards deregulating the electric power industry. These problems are natural .-hard generalizations of the single (multi)-commodity flow problems. A prototypical problem arising in this context a network with fixed link capacities that may have to service lar作者: 精密 時(shí)間: 2025-3-23 16:05
Ergebnisse der Chirurgie und Orthop?diee receivers, edges are communication tasks, and the weight of an edge is the time required for transmission), we wish to minimize the total time required for the completion of all communication tasks assuming that tasks can be preempted (that is, each edge can be subdivided into many edges with weig作者: aristocracy 時(shí)間: 2025-3-23 20:05
Ergebnisse der Chirurgie und Orthop?dieional (proxy) servers. This caching problem is very complex because of the need to consider bandwidth as well as storage constraints at the regional servers, and because of the bandwidth sharing possibilities provided by recently proposed delivery techniques..A linear mixed integer model is develope作者: Dedication 時(shí)間: 2025-3-24 01:34
Cholinesterase in der Chirurgie, availability of a great number of algorithms adapted to solve the problem in various special conditions and/or constraint formulations ([1],[19],[20])..The scope of this work is to provide an extensive treatment of shortest path problems. It starts covering the major classical approaches and procee作者: 鋼盔 時(shí)間: 2025-3-24 05:42 作者: entreat 時(shí)間: 2025-3-24 06:58
Ergebnisse der Chirurgie und Orthop?die n, and a mapping . : . → {1, 0}, determine the “best” completely defined Boolean function that is consistent with . and .. Of course, the meaning of “best” depends on the context in which this question is asked. In oil exploration, if vectors are the results of well logs and a mapping to ‘1’ means 作者: expound 時(shí)間: 2025-3-24 10:45 作者: 令人作嘔 時(shí)間: 2025-3-24 16:43
Ergebnisse der Chirurgie und Orthop?diee solution to min-cut graph partitioning problems. In their algorithm, a vertex from one set in the current partition is exchanged with a vertex in the other set to reduce the sum of the weights of cut edges. The exchanges continue until the total weight of the cut edges is no longer reduced. In thi作者: GEM 時(shí)間: 2025-3-24 23:05
https://doi.org/10.1007/978-3-642-94940-1ircuits, for combinatorial games, and for problems when instances are specified hierarchically or periodically are known to be .. Analogous to what has occurred for .-complete problems, it often makes sense to talk about the complexities of the approxi-mation problems associated with these . problem作者: jet-lag 時(shí)間: 2025-3-25 00:29 作者: ineptitude 時(shí)間: 2025-3-25 06:24 作者: synovitis 時(shí)間: 2025-3-25 10:53 作者: 空洞 時(shí)間: 2025-3-25 13:32 作者: 恫嚇 時(shí)間: 2025-3-25 16:30
Convergence Rate of the P-Algorithm for Optimization of Continuous Functions,on as a sample path of a Gaussian process. In this paper we analyze the convergence of the P-algorithm for arbitrary continuous functions, as well as under the assumption of Wiener measure on the objective functions. In both cases the convergence rate is described in terms of a parameter of the algorithm and a functional of the objective function.作者: 虛度 時(shí)間: 2025-3-25 21:40 作者: 兇猛 時(shí)間: 2025-3-26 03:43 作者: 褪色 時(shí)間: 2025-3-26 06:05
Approximation and Complexity in Numerical Optimization978-1-4757-3145-3Series ISSN 1571-568X 作者: Angiogenesis 時(shí)間: 2025-3-26 11:38 作者: 到婚嫁年齡 時(shí)間: 2025-3-26 13:47 作者: TATE 時(shí)間: 2025-3-26 20:23 作者: Climate 時(shí)間: 2025-3-26 22:30 作者: hyperuricemia 時(shí)間: 2025-3-27 02:55
Complexity and experimental evaluation of primal-dual shortest path tree algorithms,des focusing on the auction algorithm and some of its recently developed variants. There is a discussion of the theoretical and practical performance of the treated methods and numerical results are reported in order to compare their effectiveness.作者: obviate 時(shí)間: 2025-3-27 08:46 作者: Inflamed 時(shí)間: 2025-3-27 12:21 作者: Insubordinate 時(shí)間: 2025-3-27 16:06
Ergebnisse der Chirurgie und Orthop?dies paper, we consider a block exchange algorithm in which a group of vertices from one set is exchanged with a group of vertices from the other set in order to minimize the sum of the weights of cut edges. An optimal choice for the exchanged vertices is the solution to a quadratic programming problem.作者: FAZE 時(shí)間: 2025-3-27 17:47
Diabetes, Insulin und Chirurgie,tion of an MST is simple. Consequently, we are interested in the greatest lower bound for the ratio between the lengths of these both trees:.which is called the Steiner ratio (of ..)..We look for estimates for .(2, .), depending on the parameter ., and, on the other hand, we will determine general upper bounds for the Steiner ratio of ...作者: intuition 時(shí)間: 2025-3-27 22:19 作者: Gentry 時(shí)間: 2025-3-28 03:11
Diabetes, Insulin und Chirurgie,e a number of geometric techniques from 3D computer graphics like terrain triangulation and mesh simplification. We highlight the main algorithmic ideas behind the tools and formulate two novel mathematical problems that have surfaced along the way.作者: abreast 時(shí)間: 2025-3-28 07:01 作者: 一再遛 時(shí)間: 2025-3-28 13:50
Ergebnisse der Chirurgie und Orthop?diers. We will describe motivation and format of the basic model, and several enhancements to the model formulation and solution process that are necessary to solve the problem within reasonable time limits.作者: Mangle 時(shí)間: 2025-3-28 15:04 作者: antedate 時(shí)間: 2025-3-28 19:56
Navigating Graph Surfaces,e a number of geometric techniques from 3D computer graphics like terrain triangulation and mesh simplification. We highlight the main algorithmic ideas behind the tools and formulate two novel mathematical problems that have surfaced along the way.作者: 使服水土 時(shí)間: 2025-3-29 00:29
Combinatorial Problems Arising in Deregulated Electrical Power Industry: Survey and Future Directioto be . into different flow-paths..We summarize our easiness and hardness results obtained in [13, 14]. Broad conclusions of our work include:.We conclude with a brief description of our current research work and directions for future research.作者: 急性 時(shí)間: 2025-3-29 04:10 作者: Epithelium 時(shí)間: 2025-3-29 09:16 作者: 預(yù)定 時(shí)間: 2025-3-29 15:07
1571-568X practical perspective. In discrete (or combinatorial) optimization many approaches have been developed recently that link the discrete universe to the continuous universe through geomet- ric, analytic, and algebraic techniques. Such techniques include global optimization formulations, semidefinite 作者: 名字的誤用 時(shí)間: 2025-3-29 18:34 作者: Intercept 時(shí)間: 2025-3-29 20:28
Ergebnisse der Chirurgie und Orthop?die heuristic or randomized approximation. Our preliminary computational results indicate that as the number of modules in the circuit increases, the quality of the partition resulted from SDP becomes superior to that resulted from previous methods.作者: 寒冷 時(shí)間: 2025-3-30 00:46 作者: 漂亮 時(shí)間: 2025-3-30 07:28 作者: vitreous-humor 時(shí)間: 2025-3-30 11:10
Application of Semidefinite Programming to Circuit Partitioning, heuristic or randomized approximation. Our preliminary computational results indicate that as the number of modules in the circuit increases, the quality of the partition resulted from SDP becomes superior to that resulted from previous methods.作者: 很像弓] 時(shí)間: 2025-3-30 15:21 作者: Essential 時(shí)間: 2025-3-30 19:14 作者: Myelin 時(shí)間: 2025-3-30 23:25
The Steiner Ratio of ,,-planes,s, given a finite set . of points in the plane, search for a network interconnecting these points with minimal length. This shortest network must be a tree and is called a Steiner Minimal Tree (SMT). It may contain vertices different from the points which are to be connected. Such points are called 作者: 推測(cè) 時(shí)間: 2025-3-31 04:01
Hamiltonian Cycle Problem via Markov Chains and Min-type Approaches,re returning to the starting node. In this paper we solve the HCP via Markov chains and min-type functions. In addition, we present preliminary computational results with randomly generated graphs of moderate size.作者: 碳水化合物 時(shí)間: 2025-3-31 06:06
Solving Large Scale Uncapacitated Facility Location Problems,ber of customers. We use heuristics that produce a feasible integer solution and a lower bound on the optimum. In particular, we present a new heuristic whose gap from optimality was generally below 1%. The heuristic combines the volume algorithm and a recent approximation algorithm based on randomi作者: 變化無常 時(shí)間: 2025-3-31 10:10 作者: 善變 時(shí)間: 2025-3-31 15:41 作者: CLASH 時(shí)間: 2025-3-31 19:12
Convergence Rate of the P-Algorithm for Optimization of Continuous Functions,on as a sample path of a Gaussian process. In this paper we analyze the convergence of the P-algorithm for arbitrary continuous functions, as well as under the assumption of Wiener measure on the objective functions. In both cases the convergence rate is described in terms of a parameter of the algo作者: Alcove 時(shí)間: 2025-3-31 23:48
Application of Semidefinite Programming to Circuit Partitioning,the hypergraph into a weighted (undirected) graph, and then solve it as a graph partition problem using the recent semidefinite program relaxation and heuristic or randomized approximation. Our preliminary computational results indicate that as the number of modules in the circuit increases, the qua作者: Interferons 時(shí)間: 2025-4-1 03:39 作者: 混合 時(shí)間: 2025-4-1 08:42 作者: Instrumental 時(shí)間: 2025-4-1 12:43 作者: Detonate 時(shí)間: 2025-4-1 15:48 作者: 充滿人 時(shí)間: 2025-4-1 20:28
Machine Partitioning and Scheduling under Fault-Tolerance Constraints,machine load. In particular, we are given a set . of faulty parallel machines, each having an integer speedy .. and failing independently with probability ... We are also given a set of jobs to be processed on ., and a fault-tolerance constraint (1 ? .), and we seek a redundant assignment . that min作者: insecticide 時(shí)間: 2025-4-2 02:18
Finding Optimal Boolean Classifiers, n, and a mapping . : . → {1, 0}, determine the “best” completely defined Boolean function that is consistent with . and .. Of course, the meaning of “best” depends on the context in which this question is asked. In oil exploration, if vectors are the results of well logs and a mapping to ‘1’ means 作者: FLASK 時(shí)間: 2025-4-2 06:05 作者: macrophage 時(shí)間: 2025-4-2 10:20
