標題: Titlebook: Computing and Combinatorics; 9th Annual Internati Tandy Warnow,Binhai Zhu Conference proceedings 2003 Springer-Verlag Berlin Heidelberg 200 [打印本頁] 作者: retort 時間: 2025-3-21 18:54
書目名稱Computing and Combinatorics影響因子(影響力)
書目名稱Computing and Combinatorics影響因子(影響力)學科排名
書目名稱Computing and Combinatorics網(wǎng)絡公開度
書目名稱Computing and Combinatorics網(wǎng)絡公開度學科排名
書目名稱Computing and Combinatorics被引頻次
書目名稱Computing and Combinatorics被引頻次學科排名
書目名稱Computing and Combinatorics年度引用
書目名稱Computing and Combinatorics年度引用學科排名
書目名稱Computing and Combinatorics讀者反饋
書目名稱Computing and Combinatorics讀者反饋學科排名
作者: 細胞膜 時間: 2025-3-21 22:41 作者: Outmoded 時間: 2025-3-22 00:46
The Specker-Blatter Theorem Revisitedpecker and C. Blatter showed in 1981 that for every . N, .(.) satisfies a linear recurrence relation .over ?., and hence is ultimately periodic for each .. In this paper we show how the Specker-Blatter Theorem depends on the choice of constants and relations allowed in the definition of .. Among the main results we have the following:作者: GROG 時間: 2025-3-22 05:12
On the Divergence Bounded Computable Real Numbers for various functions .. We will show a simple sufficient condition for class of functions such that the corresponding .-bc real numbers form a field. Then we prove a hierarchy theorem for .-bc real numbers. Besides we compare the semi-computability and weak computability with the .-bounded computability for special functions ..作者: 狂怒 時間: 2025-3-22 11:11
The Structure and Number of Global Roundings of a Graphry . ∈ ... We conjecture that there are at most |.| + 1 global roundings for .., and also the set of global roundings is an affine independent set. We give several positive evidences for the conjecture.作者: 混亂生活 時間: 2025-3-22 12:53
,Modellprozesse für Energieumwandlungen,ime to compute a (1 + .)-approximation with probability ≥ 1/2, and can be derandomized with an additional factor of .(..). Our technique is likely applicable to TSP problems of certain Jordan arcs and related problems.作者: 混亂生活 時間: 2025-3-22 18:14
,Modellprozesse für Energieumwandlungen,eralization of adjacencies, and as a key feature of genome rearrangement theories. We also show that sets of conserved intervals have elegant nesting and chaining properties that allow the development of compact graphic representations, and linear time algorithms to manipulate them.作者: 宇宙你 時間: 2025-3-22 23:35
,Modellprozesse für Stoffumwandlungen,gcd(. ? 1, .) = 1 we have ..(.) = .(.. · (log.).). For char (.(.)) > 2 we prove that ..(.,4,.) = .(..), while for . = 2. we only have ..(. 4, .) = .(..). We can find matrices, fulfilling these lower bounds, in polynomial time. Our results extend and complement earlier results from .,., where the case . = 2 was considered.作者: harbinger 時間: 2025-3-23 01:29 作者: STELL 時間: 2025-3-23 09:37
Phasenzerfall und Phasengleichgewichte the binary reachability, allowing the automatic verification of many interesting properties of a .. The . model can be used to specify and verify various systems with unbounded queues, such as a real-time scheduler.作者: adipose-tissue 時間: 2025-3-23 10:51
https://doi.org/10.1007/978-3-540-68648-4 study Carole will be restricted to give at most . incorrect responses, or lies. Asymptotic analysis here will be for . arbitrary but fixed, . = 1 being a natural and interesting case. The game with ten queries, one hundred possibilities, and (at most) one lie is amusing to play.作者: 同步信息 時間: 2025-3-23 15:11 作者: Initial 時間: 2025-3-23 19:31
,Modellprozesse für Stoffumwandlungen,pecker and C. Blatter showed in 1981 that for every . N, .(.) satisfies a linear recurrence relation .over ?., and hence is ultimately periodic for each .. In this paper we show how the Specker-Blatter Theorem depends on the choice of constants and relations allowed in the definition of .. Among the main results we have the following:作者: 字形刻痕 時間: 2025-3-23 23:58 作者: 通情達理 時間: 2025-3-24 06:11
https://doi.org/10.1007/978-3-540-36855-7ry . ∈ ... We conjecture that there are at most |.| + 1 global roundings for .., and also the set of global roundings is an affine independent set. We give several positive evidences for the conjecture.作者: 背心 時間: 2025-3-24 09:34 作者: Palate 時間: 2025-3-24 12:01
On the Similarity of Sets of Permutations and Its Applications to Genome Comparisoneralization of adjacencies, and as a key feature of genome rearrangement theories. We also show that sets of conserved intervals have elegant nesting and chaining properties that allow the development of compact graphic representations, and linear time algorithms to manipulate them.作者: 諂媚于性 時間: 2025-3-24 14:54 作者: 沙草紙 時間: 2025-3-24 22:06
On the Full and Bottleneck Full Steiner Tree Problemsmation algorithm with performance ratio 2. for the full Steiner tree problem, where . is the best-known performance ratio for the Steiner tree problem. Moreover, we give an exact algorithm of .(|.| log |.|) time to solve the bottleneck full Steiner tree problem.作者: 高度表 時間: 2025-3-25 01:02 作者: 上釉彩 時間: 2025-3-25 05:16
,Modellprozesse für Stoffumwandlungen,ram in a superb bug report that they e-mailed to me (details are described by Bentley [.]). They had stumbled across a problem that Hoare had foreseen: selection of the partitioning element. An implementation cleverness that had stood the test of two decades worth of time had finally failed catastrophically.作者: glowing 時間: 2025-3-25 10:43
,Modellprozesse für Stoffumwandlungen,ment which consumes only .(.) space within the same amount of time. Our algorithm enables the computation for a pair of DNA sequences of length up to 10,000 to be carried out on an ordinary desktop computer. Simulation study is conducted to verify some biological facts about gene shuffling across species.作者: Aura231 時間: 2025-3-25 12:27
Experiments for Algorithm Engineeringram in a superb bug report that they e-mailed to me (details are described by Bentley [.]). They had stumbled across a problem that Hoare had foreseen: selection of the partitioning element. An implementation cleverness that had stood the test of two decades worth of time had finally failed catastrophically.作者: 領帶 時間: 2025-3-25 19:23
A Space Efficient Algorithm for Sequence Alignment with Inversionsment which consumes only .(.) space within the same amount of time. Our algorithm enables the computation for a pair of DNA sequences of length up to 10,000 to be carried out on an ordinary desktop computer. Simulation study is conducted to verify some biological facts about gene shuffling across species.作者: 名字的誤用 時間: 2025-3-25 22:20
Cylindrical Hierarchy for Deforming Necklaceswe investigate a problem of covering a necklace by cylinders. We consider several problems under different optimization criteria. We show that optimal cylindrical cover of a necklace with . beads in ?. by . cylinders can be computed in polynomial time. We also study a bounding volume hierarchy based on cylinders.作者: lymphedema 時間: 2025-3-26 02:10 作者: G-spot 時間: 2025-3-26 05:39 作者: resuscitation 時間: 2025-3-26 09:24 作者: 含鐵 時間: 2025-3-26 16:20 作者: Lipoprotein(A) 時間: 2025-3-26 19:36
Computing and Combinatorics978-3-540-45071-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: VOK 時間: 2025-3-26 22:27
0302-9743 Overview: 978-3-540-40534-4978-3-540-45071-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 施舍 時間: 2025-3-27 02:05
,Modellprozesse für Energieumwandlungen,we investigate a problem of covering a necklace by cylinders. We consider several problems under different optimization criteria. We show that optimal cylindrical cover of a necklace with . beads in ?. by . cylinders can be computed in polynomial time. We also study a bounding volume hierarchy based on cylinders.作者: nauseate 時間: 2025-3-27 05:44 作者: Herd-Immunity 時間: 2025-3-27 09:26
Phasenzerfall und Phasengleichgewichteuch as . Petri nets and more. A new . approach is applied to developing an integer linear programming formulation for characterizing the reachability sets of such Petri nets. Consequently, the reachability problem is shown to be NP-complete. The model checking problem for some temporal logics is also investigated for simple-circuit Petri nets.作者: 繁榮中國 時間: 2025-3-27 17:24 作者: arthroplasty 時間: 2025-3-27 18:24 作者: Inoperable 時間: 2025-3-27 22:38
,Modellprozesse für Stoffumwandlungen,of populations to associate specific haplotypes with specific complex genetic-influenced diseases. A key, perhaps bottleneck, problem is to computationally determine haplotype pairs from genotype data. An approach to this problem based on viewing it in the context of perfect phylogeny was introduced作者: 帽子 時間: 2025-3-28 03:13
,Modellprozesse für Energieumwandlungen,we investigate a problem of covering a necklace by cylinders. We consider several problems under different optimization criteria. We show that optimal cylindrical cover of a necklace with . beads in ?. by . cylinders can be computed in polynomial time. We also study a bounding volume hierarchy based作者: Intuitive 時間: 2025-3-28 09:38 作者: conformity 時間: 2025-3-28 14:08
,Modellprozesse für Energieumwandlungen,g salesman tour is sought to traverse a set of .-separated segments in two dimensional space. Our results are based on a number of geometric observations and an interesting generalization of Arora’s technique . for Euclidean TSP (of a set of points). The randomized version of our algorithm takes . t作者: CRUE 時間: 2025-3-28 17:20
,Modellprozesse für Stoffumwandlungen,dependent set, minimum vertex cover and maximum induced subgraph with polynomial-time testable hereditary property .. We show that they can be exactly solved in subexponential time, more precisely, in time ., by applying Miller’s simple cycle planar separator theorem . (in spite of the fact that the作者: aggrieve 時間: 2025-3-28 22:28 作者: 杠桿 時間: 2025-3-29 01:21
,Modellprozesse für Energieumwandlungen,asuring how much they are alike. With the notable exception of the breakpoint distance, which is based on the concept of conserved adjacencies, measures of distance do not generalize easily to sets of more than two permutations. In this paper, we present a basic unifying notion, ., as a powerful gen作者: AROMA 時間: 2025-3-29 06:59
,Modellprozesse für Stoffumwandlungen,ings of . can be solved by the classical Needleman-Wunsch and Smith-Waterman algorithms, respectively, which takes .(...) time and .(..) space. This paper proposes faster algorithms that take .(..) time and .(.) space. The improvement stems from a compact way to represent all the alignment scores.作者: 昏睡中 時間: 2025-3-29 08:52
,Modellprozesse für Stoffumwandlungen,e denote by .(.) the number of structures of size .. For . definable in Monadic Second Order Logic . with unary and binary relation symbols only, E. Specker and C. Blatter showed in 1981 that for every . N, .(.) satisfies a linear recurrence relation .over ?., and hence is ultimately periodic for ea作者: Precursor 時間: 2025-3-29 15:05 作者: Ceremony 時間: 2025-3-29 18:21 作者: 引導 時間: 2025-3-29 22:46 作者: nocturia 時間: 2025-3-30 01:45 作者: PANG 時間: 2025-3-30 06:50
https://doi.org/10.1007/978-3-540-36855-7 vertices have even degree (it’s called an .). Combined with a classical Whitney’s Theorem, this result implies that every such a graph has a 3-colorable plane triangulation. Using this theorem, Hoffmann and Kriegel significantly improved the upper bounds of several art gallery and prison guard prob作者: Oafishness 時間: 2025-3-30 11:04 作者: Allodynia 時間: 2025-3-30 13:08
Phasenzerfall und Phasengleichgewichteer-valued clocks. Due to careful restrictions on queue usage, the binary reachability (the set of all pairs of configurations (.) of an . such that . can reach . through zero or more transitions) is effectively semilinear. We then prove the decidability of a class of Presburger formulae defined over作者: hangdog 時間: 2025-3-30 16:49 作者: HEDGE 時間: 2025-3-30 23:14
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/234772.jpg作者: LIKEN 時間: 2025-3-31 01:34 作者: commute 時間: 2025-3-31 09:06
Subexponential-Time Algorithms for Maximum Independent Set and Related Problems on Box Graphsonential algorithms for maximum independent set and the maximum induced subgraph with polynomial-time testable hereditary property . problems can yield non-trivial upper bounds on approximation factors achievable in polynomial time.作者: Jocose 時間: 2025-3-31 09:30
On Even Triangulations of 2-Connected Embedded Graphse existence of even triangulations for similar graphs on high genus surfaces. Hence we show that Hoffmann and Kriegel’s theorem remains valid for such graphs. Our new proof leads to a very simple linear time algorithm for finding even triangulations.作者: Fsh238 時間: 2025-3-31 14:42
List Total Colorings of Series-Parallel Graphsand . of ., respectively. The theorem implies that any series-parallel graph . has a total coloring with .+1 colors if . ≥ 4. We finally present a linear-time algorithm to find a list total coloring of a given series-parallel graph . if . satisfies the sufficient condition.作者: Affable 時間: 2025-3-31 19:14 作者: Pillory 時間: 2025-4-1 01:41
,Modellprozesse für Stoffumwandlungen,onential algorithms for maximum independent set and the maximum induced subgraph with polynomial-time testable hereditary property . problems can yield non-trivial upper bounds on approximation factors achievable in polynomial time.作者: HUSH 時間: 2025-4-1 04:30
https://doi.org/10.1007/978-3-540-36855-7e existence of even triangulations for similar graphs on high genus surfaces. Hence we show that Hoffmann and Kriegel’s theorem remains valid for such graphs. Our new proof leads to a very simple linear time algorithm for finding even triangulations.作者: 感情脆弱 時間: 2025-4-1 08:19 作者: 形容詞 時間: 2025-4-1 12:48
LIAR!estions” Paul wins if and only if . ≤ 2.. In Liar Games, Carole is allowed, under certain restrictions, to give an incorrect response. Throughout this study Carole will be restricted to give at most . incorrect responses, or lies. Asymptotic analysis here will be for . arbitrary but fixed, . = 1 bei作者: 倔強不能 時間: 2025-4-1 18:04
Experiments for Algorithm Engineeringed in the Unix system’s main memory sort function, qsort. For two decades, that code performed admirably..In the early 1990s, Alan Wilks and Rick Becker once again used that old, reliable program, and were stunned by the results. A run that should have taken a few minutes was cancelled after hours. 作者: 描繪 時間: 2025-4-1 22:12 作者: stratum-corneum 時間: 2025-4-2 02:15
Cylindrical Hierarchy for Deforming Necklaceswe investigate a problem of covering a necklace by cylinders. We consider several problems under different optimization criteria. We show that optimal cylindrical cover of a necklace with . beads in ?. by . cylinders can be computed in polynomial time. We also study a bounding volume hierarchy based作者: hallow 時間: 2025-4-2 05:26
Geometric Algorithms for Agglomerative Hierarchical Clusteringand median AHC algorithms and an approximate singlelink AHC algorithm for clustering data objects in the .-D space for any constant integer . ≥ 2; the time and space bounds of all our algorithms are .(. log .) and .(.), where . is the size of the input data set. Previously best algorithmic approache作者: Bridle 時間: 2025-4-2 10:54
Traveling Salesman Problem of Segmentsg salesman tour is sought to traverse a set of .-separated segments in two dimensional space. Our results are based on a number of geometric observations and an interesting generalization of Arora’s technique . for Euclidean TSP (of a set of points). The randomized version of our algorithm takes . t作者: WAG 時間: 2025-4-2 13:39
Subexponential-Time Algorithms for Maximum Independent Set and Related Problems on Box Graphsdependent set, minimum vertex cover and maximum induced subgraph with polynomial-time testable hereditary property .. We show that they can be exactly solved in subexponential time, more precisely, in time ., by applying Miller’s simple cycle planar separator theorem . (in spite of the fact that the作者: 積云 時間: 2025-4-2 18:33
