找回密碼
 To register

QQ登錄

只需一步,快速開(kāi)始

掃一掃,訪問(wèn)微社區(qū)

打印 上一主題 下一主題

Titlebook: Automata, Languages and Programming; 30th International C Jos C. M. Baeten,Jan Karel Lenstra,Gerhard J. Woeg Conference proceedings 2003 Sp

[復(fù)制鏈接]
樓主: 類屬
41#
發(fā)表于 2025-3-28 15:10:57 | 只看該作者
On the Axiomatizability of Ready Traces, Ready Simulation, and Failure Traceshabet of actions is finite, then there exists a (sound and complete) finite equational axiomatization for the process algebra BCCSP modulo ready trace semantics. We prove that if the alphabet is infinite, then such an axiomatization does not exist. Furthermore, we present finite equational axiomatiz
42#
發(fā)表于 2025-3-28 20:31:53 | 只看該作者
43#
發(fā)表于 2025-3-29 00:46:26 | 只看該作者
44#
發(fā)表于 2025-3-29 05:24:19 | 只看該作者
45#
發(fā)表于 2025-3-29 11:13:58 | 只看該作者
An Improved Approximation Algorithm for the Asymmetric TSP with Strengthened Triangle Inequality .(.) ≤ . · (.(.) + .(.)) for all nodes .. Chandran and Ram [.] recently gave the first constant factor approximation algorithm with polynomial running time for this problem. They achieve performance ratio ./1?.. We devise an approximation algorithm with performance ratio ., which is better than the
46#
發(fā)表于 2025-3-29 11:50:06 | 只看該作者
47#
發(fā)表于 2025-3-29 16:55:10 | 只看該作者
Approximation Schemes for Degree-Restricted MST and Red-Blue Separation Problemfor approximating TSP. Given . points in the plane, . = 2 or 3, and . > 0, the scheme finds an approximation with cost within 1 + . of the lowest cost spanning tree with the property that all nodes have degree at most .. We also develop a polynomial time approximation scheme for the Euclidean versio
48#
發(fā)表于 2025-3-29 21:11:51 | 只看該作者
Approximating Steiner ,-Cutsrected graph . = (.), a subset of vertices ... called ., and an integer . ≤ |.|, the objective is to find a minimum weight set of edges whose removal results in . disconnected components, each of which contains at least one terminal. We give two approximation algorithms for the problem: a 2 ? 2/.-ap
49#
發(fā)表于 2025-3-30 00:34:13 | 只看該作者
50#
發(fā)表于 2025-3-30 06:57:16 | 只看該作者
Approximation Algorithm for Directed Telephone Multicast Problemdiscrete “rounds”, and in every round every processor is allowed to pick one of its neighbors, and to send him a message. The . problem requires to compute a schedule with minimal number of rounds that delivers a message from a given single processor, that generates the message, to all the processor
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛(ài)論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-23 09:34
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
洮南市| 宽城| 历史| 台山市| 车致| 监利县| 宝兴县| 德昌县| 丰城市| 额尔古纳市| 乐山市| 京山县| 北川| 浠水县| 繁昌县| 富裕县| 瓦房店市| 金秀| 佛山市| 渝中区| 冀州市| 罗平县| 新疆| 讷河市| 正阳县| 皮山县| 涞水县| 富锦市| 溧阳市| 合肥市| 黄石市| 松滋市| 南昌市| 华蓥市| 从化市| 那坡县| 松潘县| 墨竹工卡县| 锡林郭勒盟| 营山县| 安多县|