找回密碼
 To register

QQ登錄

只需一步,快速開始

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

打印 上一主題 下一主題

Titlebook: Advances in Computing and Information - ICCI ‘91; International Confer Frank Dehne,Frantisek Fiala,Waldemar W. Koczkodaj Conference proceed

[復(fù)制鏈接]
樓主: CULT
41#
發(fā)表于 2025-3-28 15:53:43 | 只看該作者
User Interfaces for CSCW Systems,rence of the depths of the subtrees is bounded. We call these trees .. If this difference is a constant on the size of the depth d of the tree, then an O(log d) algorithm is presented. For any depth difference F(d), where F(d)?d, the approximation factor becomes O(F(d)log d).
42#
發(fā)表于 2025-3-28 20:38:17 | 只看該作者
43#
發(fā)表于 2025-3-29 00:07:28 | 只看該作者
44#
發(fā)表于 2025-3-29 05:49:50 | 只看該作者
https://doi.org/10.1007/978-1-4471-2009-4, we assume that each interval has a weight, and provide an O(knlogn) algorithm for k-coloring a set of intervals of maximum total weight. The best previous algorithm for this problem required time O(n.logn). These results provide improved solutions to problems of local register allocation, task scheduling, and the routing of nets on a chip.
45#
發(fā)表于 2025-3-29 09:21:32 | 只看該作者
Computer Supported Cooperative Work algorithm that, using only the parity of the degree of each vertex, colors the vertices of a triangulated simple polygon using three colors. The second algorithm reconstructs the polygon and its triangulation from the degree sequence. We then show that our results extend to .-trees.
46#
發(fā)表于 2025-3-29 13:53:36 | 只看該作者
Katie Phillps,Peter H. Hwang,Zara M. Patelof constraint equalities results in less elementary checking operations and hence an overall increase in efficiency in the normalization effort. The relationship among (.)-JDs of various degrees and orders is also studied and formalised.
47#
發(fā)表于 2025-3-29 16:13:42 | 只看該作者
48#
發(fā)表于 2025-3-29 20:22:18 | 只看該作者
49#
發(fā)表于 2025-3-30 02:11:52 | 只看該作者
Computer Supported Cooperative Workresentation, we will explore some similarities and differences between these research areas by giving examples of problems which appear to be tractable in one area and not the other, and conclude with some ideas for building conceptual bridges.
50#
發(fā)表于 2025-3-30 05:39:21 | 只看該作者
CSCW and Artificial Intelligenceg algorithm, optimal with respect to five important measures of presortedness and smoothly adaptive from .(.) to .(. log .) time for other common measures. Moreover, we extend the proof techniques to analyze an adaptive variant of .; previous claims were based only on simulation results.
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2026-1-25 03:45
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
壶关县| 南康市| 柳林县| 双城市| 武夷山市| 苗栗县| 盐边县| 广宗县| 南宁市| 马山县| 江华| 海安县| 大厂| 贵港市| 民丰县| 南投县| 葫芦岛市| 安岳县| 拉孜县| 东山县| 苍溪县| 南城县| 沂南县| 上饶市| 江安县| 温宿县| 长子县| 湟中县| 天水市| 新化县| 霞浦县| 垫江县| 哈巴河县| 宣汉县| 福安市| 达拉特旗| 安康市| 仁化县| 清涧县| 容城县| 昂仁县|