標(biāo)題: Titlebook: Algorithmic Aspects in Information and Management; 6th International Co Bo Chen Conference proceedings 2010 Springer-Verlag Berlin Heidelbe [打印本頁] 作者: Osteopenia 時(shí)間: 2025-3-21 17:28
書目名稱Algorithmic Aspects in Information and Management影響因子(影響力)
書目名稱Algorithmic Aspects in Information and Management影響因子(影響力)學(xué)科排名
書目名稱Algorithmic Aspects in Information and Management網(wǎng)絡(luò)公開度
書目名稱Algorithmic Aspects in Information and Management網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Algorithmic Aspects in Information and Management被引頻次
書目名稱Algorithmic Aspects in Information and Management被引頻次學(xué)科排名
書目名稱Algorithmic Aspects in Information and Management年度引用
書目名稱Algorithmic Aspects in Information and Management年度引用學(xué)科排名
書目名稱Algorithmic Aspects in Information and Management讀者反饋
書目名稱Algorithmic Aspects in Information and Management讀者反饋學(xué)科排名
作者: PHONE 時(shí)間: 2025-3-21 21:34
The (,,,)-Capacitated Spanning Tree Problem,This paper considers a generalization of the capacitated spanning tree, in which some of the nodes have capacity ., and the others have capacity .?
作者: Glaci冰 時(shí)間: 2025-3-22 04:25
https://doi.org/10.1007/978-3-642-14355-7DNA matching; algorithms; artificial intelligence; graph coloring; nearest neighbour; risk management; roa作者: 頑固 時(shí)間: 2025-3-22 05:29
978-3-642-14354-0Springer-Verlag Berlin Heidelberg 2010作者: 騷動(dòng) 時(shí)間: 2025-3-22 12:35
Algorithmic Aspects in Information and Management978-3-642-14355-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 鞭打 時(shí)間: 2025-3-22 14:17
2.5.4 Chloroiodo- and Fluoroiodoalkanes,the ergodic theory of Markov processes. We compare in detail the link graph used in PageRank and the user browsing graph used in BrowseRank. Along with the comparison, the importance of the metadata contained in the user browsing graph is explored.作者: gorgeous 時(shí)間: 2025-3-22 19:02
2.5.4 Chloroiodo- and Fluoroiodoalkanes,ves an approximation ratio of roughly 0.842 and runs in .(...) time, where . (respectively, .) is the number of vertices (respectively, edges) in the input graph. The previously best ratio achieved by a polynomial-time approximation algorithm was ..作者: Myofibrils 時(shí)間: 2025-3-22 23:17 作者: 進(jìn)取心 時(shí)間: 2025-3-23 03:15 作者: 取消 時(shí)間: 2025-3-23 08:56
Approximating Maximum Edge 2-Coloring in Simple Graphs,ves an approximation ratio of roughly 0.842 and runs in .(...) time, where . (respectively, .) is the number of vertices (respectively, edges) in the input graph. The previously best ratio achieved by a polynomial-time approximation algorithm was ..作者: recession 時(shí)間: 2025-3-23 12:39 作者: 影響深遠(yuǎn) 時(shí)間: 2025-3-23 17:16 作者: Impugn 時(shí)間: 2025-3-23 20:54
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/152896.jpg作者: 削減 時(shí)間: 2025-3-24 01:51 作者: CAPE 時(shí)間: 2025-3-24 04:06
2.5.4 Chloroiodo- and Fluoroiodoalkanes, stage). The second stage environment is uncertain at the time of investment, hence the first stage also involves trading in financial instruments, eg, hedges against high generation costs due to rising fuel costs..The classical Invisible Hand says that if generators and consumers act in their own b作者: Rejuvenate 時(shí)間: 2025-3-24 07:32 作者: 1分開 時(shí)間: 2025-3-24 13:52
2.5.4 Chloroiodo- and Fluoroiodoalkanes,h supplier is characterized by one of two types of order cost structures: incremental quantity discount cost structure and multiple set-ups cost structure. The problem is challenging due to the mix of different cost structures. By analyzing the optimal properties, we reduce the searching range of th作者: Endearing 時(shí)間: 2025-3-24 15:27 作者: 大氣層 時(shí)間: 2025-3-24 21:01
2.5.4 Chloroiodo- and Fluoroiodoalkanes,y solved in a special subclass which we call regular bimatrix games. The current best approximation algorithm, proposed in [19], achieves a guarantee of 0.3393. In this paper we design a polynomial time algorithm for computing exact and approximate Nash equilibria for bimatrix games. The novelty of 作者: PTCA635 時(shí)間: 2025-3-25 02:09
2.5.4 Chloroiodo- and Fluoroiodoalkanes,onments led by the reform, we find that right issues dominate before the reform, however, public offerings (including private placement) dominate after reform, which could be attributed to more money encirclement induced by the shift of the public offering mechanism from in discount to in premium af作者: Constituent 時(shí)間: 2025-3-25 04:47
2.5.4 Chloroiodo- and Fluoroiodoalkanes,ves an approximation ratio of roughly 0.842 and runs in .(...) time, where . (respectively, .) is the number of vertices (respectively, edges) in the input graph. The previously best ratio achieved by a polynomial-time approximation algorithm was ..作者: 秘傳 時(shí)間: 2025-3-25 11:02
2.5.4 Chloroiodo- and Fluoroiodoalkanes,a special case of Bounded-Degree Vertex Deletion, the Co-Path/Cycle Packing problem, which asks to delete as few vertices as possible such that the graph of the remaining (residual) vertices is composed of disjoint paths and simple cycles. The problem falls into the well-known class of ’node-deletio作者: 燈泡 時(shí)間: 2025-3-25 15:01
2.5.4 Chloroiodo- and Fluoroiodoalkanes,ce level using the four moments (e.g. mean, variance, skewness and kurtosis) of the warrants portfolio return and estimating the variance of portfolio by EWMA methodology. Meanwhile, the proposed algorithm considers the attenuation of the effect of history return on portfolio return of future days. 作者: BUDGE 時(shí)間: 2025-3-25 18:40 作者: cruise 時(shí)間: 2025-3-25 23:11 作者: Lineage 時(shí)間: 2025-3-26 02:13 作者: 專橫 時(shí)間: 2025-3-26 05:45
2.5.4 Chloroiodo- and Fluoroiodoalkanes, unique delivery capacity. Suppose we have a set of jobs each with a committed delivery time, processing time, production window, and profit. The company can earn the profit if the job is produced in its production window and delivered before its committed delivery time. From the company point of vi作者: 繼而發(fā)生 時(shí)間: 2025-3-26 11:22
Densities of Monocyclic Hydrocarbonsmedian of modified location problem. We first present the model of inverse 1-median problem on trees. Then we propose two algorithms to solve the problem under weighted .. norm with bound constraints on modifications. Based on the approach of the unbounded case, we devise a greedy-type algorithm whi作者: 禁止 時(shí)間: 2025-3-26 16:21
6 Monocyclic Hydrocarbons, CnH(2n-8),tly one of the nodes . and . is NP-hard. Such an edge is called a weak edge. We then develop a polynomial time approximation algorithm for the vertex cover problem with performance guarantee ., where . is an upper bound on a measure related to a weak edge of a graph. Further, we discuss a new relaxa作者: 命令變成大炮 時(shí)間: 2025-3-26 16:53 作者: Motilin 時(shí)間: 2025-3-26 22:48
Densities of Monocyclic Hydrocarbonsequences. To build an indexing data structure on the concatenation of all sequences may require a lot of memory. In this paper, we propose a new scheme to index highly similar sequences by taking advantage of the similarity among the sequences. To store . sequences with . common segments, our index 作者: NATTY 時(shí)間: 2025-3-27 03:15
0302-9743 e are full of algorithmic challenges, the proliferation of data has called for the design of e?cient and e?ective algorithms and data structures for their management and processing. The International Conference on Algorithmic Aspects in Information and Management(AAIM) is intended for originalalgori作者: BLANC 時(shí)間: 2025-3-27 05:41
2.5.4 Chloroiodo- and Fluoroiodoalkanes,ture. The problem is challenging due to the mix of different cost structures. By analyzing the optimal properties, we reduce the searching range of the optimal solutions and develop several optimal algorithms to solve all cases of this multi-supplier problem.作者: 永久 時(shí)間: 2025-3-27 13:06
2.5.4 Chloroiodo- and Fluoroiodoalkanes,r reform, which could be attributed to more money encirclement induced by the shift of the public offering mechanism from in discount to in premium after reform and no requirements for large shareholders’ participation commitments in public offerings.作者: Hallmark 時(shí)間: 2025-3-27 14:54 作者: thyroid-hormone 時(shí)間: 2025-3-27 21:27 作者: 進(jìn)步 時(shí)間: 2025-3-27 22:05 作者: 易發(fā)怒 時(shí)間: 2025-3-28 04:37
Where Would Refinancing Preferences Go?,r reform, which could be attributed to more money encirclement induced by the shift of the public offering mechanism from in discount to in premium after reform and no requirements for large shareholders’ participation commitments in public offerings.作者: tangle 時(shí)間: 2025-3-28 06:41 作者: compel 時(shí)間: 2025-3-28 10:32
On the Approximability of the Vertex Cover and Related Problems,cover problem with performance guarantee ., where . is an upper bound on a measure related to a weak edge of a graph. Further, we discuss a new relaxation of the vertex cover problem which is used in our approximation algorithm to obtain smaller values of ..作者: Volatile-Oils 時(shí)間: 2025-3-28 17:46
2.5.4 Chloroiodo- and Fluoroiodoalkanes,es and algorithmic behavior. Although both generators prove to be reasonably good models, our new generator outperforms the existing one with respect to both structural properties and algorithmic behavior.作者: IRS 時(shí)間: 2025-3-28 22:50 作者: meritorious 時(shí)間: 2025-3-28 23:33
2.5.4 Chloroiodo- and Fluoroiodoalkanes,he computed tour of . sub-instance (of the current iteration) containing this edge is denoted to be a pseudo backbone edge. Paths of pseudo-backbone edges are contracted to single edges which are fixed during the subsequent process.作者: CURL 時(shí)間: 2025-3-29 03:39 作者: commonsense 時(shí)間: 2025-3-29 07:17 作者: Incumbent 時(shí)間: 2025-3-29 14:45 作者: deciduous 時(shí)間: 2025-3-29 17:01
Finding Good Tours for Huge Euclidean TSP Instances by Iterative Backbone Contraction,he computed tour of . sub-instance (of the current iteration) containing this edge is denoted to be a pseudo backbone edge. Paths of pseudo-backbone edges are contracted to single edges which are fixed during the subsequent process.作者: lymphoma 時(shí)間: 2025-3-29 20:13 作者: 帶來墨水 時(shí)間: 2025-3-30 01:16 作者: Exploit 時(shí)間: 2025-3-30 04:35 作者: Lymphocyte 時(shí)間: 2025-3-30 09:25
Computing Exact and Approximate Nash Equilibria in 2-Player Games,et of constraints which can be expressed through linear programming, while, in the general case, it computes .-approximate Nash equilibria, where . is the maximum difference between any two payoffs in the same strategy of any player. Hence, our algorithm improves the best know approximation guarantee for the bimatrices in which .
作者: 溫室 時(shí)間: 2025-3-30 13:39
Point Location in the Continuous-Time Moving Network,ection 3). The second variation views query point . as a customer with walking speed .. The question is which site he can catch the first? We can answer this query in .(.?+?log(.log.)) time with same preprocessing time and space as the first case. If the customer is located at some node, then the query can be answered in .(log(.log.)) time.作者: Musket 時(shí)間: 2025-3-30 19:10
Conference proceedings 2010gn of e?cient and e?ective algorithms and data structures for their management and processing. The International Conference on Algorithmic Aspects in Information and Management(AAIM) is intended for originalalgorithmicresearchon immediate applications and/or fundamental problems pertinent to informa作者: 會犯錯(cuò)誤 時(shí)間: 2025-3-30 21:27 作者: gain631 時(shí)間: 2025-3-31 04:17 作者: intertwine 時(shí)間: 2025-3-31 08:06 作者: 光滑 時(shí)間: 2025-3-31 13:10
Some Results on Incremental Vertex Cover Problem,lden ratio. We then consider the restricted versions where . is restricted to one of two given values(Named 2-IVC problem) and one of three given values(Named 3-IVC problem). For 2-IVC problem, we give an algorithm to prove that the competitive ratio is at most .. This incremental algorithm is also 作者: FLIT 時(shí)間: 2025-3-31 14:23
Indexing Similar DNA Sequences, number of occurrences of . in all sequences. In practice, .?≤?., and .(.) is usually a small constant. We have implemented our solution and evaluated our solution using real DNA sequences. The experiments show that the memory requirement of our solution is much less than that required by BWT built 作者: 合并 時(shí)間: 2025-3-31 17:50
Conference proceedings 2010.Eachsubmissionwasreviewedbythreemembersof the ProgramC- mittee or their deputies on the quality, originality, soundness, and signi?cance of its contribution. The committee decided to accept 31 papers. The program also included two invited keynote talks. The success of the conference resulted from t
