忠诚 发表于 2025-3-21 20:07:58

书目名称SOFSEM 2007: Theory and Practice of Computer Science影响因子(影响力)<br>        http://impactfactor.cn/if/?ISSN=BK0860216<br><br>        <br><br>书目名称SOFSEM 2007: Theory and Practice of Computer Science影响因子(影响力)学科排名<br>        http://impactfactor.cn/ifr/?ISSN=BK0860216<br><br>        <br><br>书目名称SOFSEM 2007: Theory and Practice of Computer Science网络公开度<br>        http://impactfactor.cn/at/?ISSN=BK0860216<br><br>        <br><br>书目名称SOFSEM 2007: Theory and Practice of Computer Science网络公开度学科排名<br>        http://impactfactor.cn/atr/?ISSN=BK0860216<br><br>        <br><br>书目名称SOFSEM 2007: Theory and Practice of Computer Science被引频次<br>        http://impactfactor.cn/tc/?ISSN=BK0860216<br><br>        <br><br>书目名称SOFSEM 2007: Theory and Practice of Computer Science被引频次学科排名<br>        http://impactfactor.cn/tcr/?ISSN=BK0860216<br><br>        <br><br>书目名称SOFSEM 2007: Theory and Practice of Computer Science年度引用<br>        http://impactfactor.cn/ii/?ISSN=BK0860216<br><br>        <br><br>书目名称SOFSEM 2007: Theory and Practice of Computer Science年度引用学科排名<br>        http://impactfactor.cn/iir/?ISSN=BK0860216<br><br>        <br><br>书目名称SOFSEM 2007: Theory and Practice of Computer Science读者反馈<br>        http://impactfactor.cn/5y/?ISSN=BK0860216<br><br>        <br><br>书目名称SOFSEM 2007: Theory and Practice of Computer Science读者反馈学科排名<br>        http://impactfactor.cn/5yr/?ISSN=BK0860216<br><br>        <br><br>

后退 发表于 2025-3-21 23:30:59

A Software Architecture for Shared Resource Management in Mobile Ad Hoc NetworksBFA) provides a virtual ring using the clusterheads found by MCA. Finally, an example resource management protocol which is a modified and scaled version of the Ricart-Agrawala algorithm implemented using the virtual ring structure is presented with the performance results.

encyclopedia 发表于 2025-3-22 04:08:33

Fast Approximate Point Set Matching for Information Retrievaln based on correlation calculations using fast Fourier transforms. Both methods are shown experimentally to give answers within a few percent of the exact solution and provide a considerable practical speedup over existing deterministic algorithms.

隐士 发表于 2025-3-22 05:57:00

http://reply.papertrans.cn/87/8603/860216/860216_4.png

Anterior 发表于 2025-3-22 12:48:10

http://reply.papertrans.cn/87/8603/860216/860216_5.png

无意 发表于 2025-3-22 14:19:56

http://reply.papertrans.cn/87/8603/860216/860216_6.png

myelography 发表于 2025-3-22 18:00:01

http://reply.papertrans.cn/87/8603/860216/860216_7.png

Ancestor 发表于 2025-3-22 22:15:11

http://reply.papertrans.cn/87/8603/860216/860216_8.png

痛打 发表于 2025-3-23 03:17:40

Straightening Drawings of Clustered Hierarchical Graphsns. Second we give a linear programming (LP) formulation that always yields a drawing that fulfills the above three requirements—if such a drawing exists. The size of our LP formulation is linear in the size of the graph.

土产 发表于 2025-3-23 06:17:59

Improved Upper Bounds for ,-Backbone Colorings Along Matchings and Starsgraphs have a nice structure, these results are difficult to prove. Our proofs combine algorithmic and combinatorial arguments. We also indicate other graph classes for which our results imply better upper bounds on ℓ than the previously known bounds.
页: [1] 2 3 4 5 6 7
查看完整版本: Titlebook: SOFSEM 2007: Theory and Practice of Computer Science; 33nd Conference on C Jan Leeuwen,Giuseppe F. Italiano,František Plášil Conference pro