找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

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

[复制链接]
楼主: CULT
发表于 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).
发表于 2025-3-28 20:38:17 | 显示全部楼层
发表于 2025-3-29 00:07:28 | 显示全部楼层
发表于 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.
发表于 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.
发表于 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.
发表于 2025-3-29 16:13:42 | 显示全部楼层
发表于 2025-3-29 20:22:18 | 显示全部楼层
发表于 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.
发表于 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.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-17 14:13
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表