Foundations of Computer Science (The 2013 Worldcomp International Conference Proceedings)

個数:

Foundations of Computer Science (The 2013 Worldcomp International Conference Proceedings)

  • 在庫がございません。海外の書籍取次会社を通じて出版社等からお取り寄せいたします。
    通常6~9週間ほどで発送の見込みですが、商品によってはさらに時間がかかることもございます。
    重要ご説明事項
    1. 納期遅延や、ご入手不能となる場合がございます。
    2. 複数冊ご注文の場合は、ご注文数量が揃ってからまとめて発送いたします。
    3. 美品のご指定は承りかねます。

    ●3Dセキュア導入とクレジットカードによるお支払いについて
  • 【入荷遅延について】
    世界情勢の影響により、海外からお取り寄せとなる洋書・洋古書の入荷が、表示している標準的な納期よりも遅延する場合がございます。
    おそれいりますが、あらかじめご了承くださいますようお願い申し上げます。
  • ◆画像の表紙や帯等は実物とは異なる場合があります。
  • ◆ウェブストアでの洋書販売価格は、弊社店舗等での販売価格とは異なります。
    また、洋書販売価格は、ご注文確定時点での日本円価格となります。
    ご注文確定後に、同じ洋書の販売価格が変動しても、それは反映されません。
  • 製本 Paperback:紙装版/ペーパーバック版/ページ数 197 p.
  • 言語 ENG
  • 商品コード 9781601322425
  • DDC分類 004

Full Description

Foundations of Computer Science is a compendium of articles and papers that were presented at FCS '13, an international conference that serves researchers, scholars, professionals, students, and academicians.

Selected topics include:

HPC + Load-Balancing + Approximation Algorithms + N-P Hard Problems
Formal Verification + Automata
Encryption + Calculus + Testing Methods And New Methodologies
Quantum Computing
Grammar Rules and Text Compression Methods

Contents

Session: HPC + Load-Balancing + Approximation Algorithms + N-P Hard Problems
1) Stencil and Lattice Structures for Field Equation Model Simulations on GPUs
2) The Complexity and Algorithm for k-Duplicates Combinatorial Auctions with Submodular and Subadditive Bidders
3) Optimising Computations for Evaluating Ising and Potts Model Partition Functions by Exact Enumeration
4) A Functional Approach to Finding Answer Sets
5) Lag-based Load Balancing for Linux-based Multicore Systems
Session: Graph Based Methods + Related Issues
1) Generating Edge Covers of Path Graphs
2) Finding Paths with Minimum Shared Edges in Graphs with Bounded Treewidth
3) Labeling for Vertices in Strict 2-Threshold Graphs
4) Weak Convex Restrained Dominating Critical Graphs
Session: Formal Verification + Automata
1) Formalization Description of Huffman Coding Trees Using Mizar
2) Extended Timed Alternating Finite Automata: Revisited
3) Formalization of Binary Fields and N-dimensional Binary Vector Spaces Using the Mizar Proof Checker
Session: Encryption + Calculus + Testing Methods and New Methodologies
1) On the Expressiveness of Monadic Higher Order Safe Ambient Calculus
2) Test Case Generation and Execution based on Record-Replayer Mechanism
3) Normal Bisimulation for Higher Order pi-Calculus with Passivation Revisited
4) Bit Level Encryption Standard (BLES) : Version-III
5) Energy Efficient Multi Level Authentication in Adhoc Sensor Network
6) Energy Efficient Encryption Using Counter Mode of Operation in Wireless Sensor Network
7) Advanced Symmetric Key Cryptosystem Using Bit and Byte Level Encryption Methods with Feedback
8) Modern Encryption Standard (MES) : Version III
Session: Quantum Computing
1) Equivalence of the Foulis-Holland Theorems and the Orthomodular Law in Quantum Logic: Part 1
2) Equivalence of the Foulis-Holland Theorems and the Orthomodular Law in Quantum Logic: Part 2
3) Equivalence of the Foulis-Holland Theorems and the Orthomodular Law in Quantum Logic: Part 3
4) Equivalence of the Foulis-Holland Theorems and the Orthomodular Law in Quantum Logic: Part 4
5) Equivalence of the Foulis-Holland Theorems and the Orthomodular Law in Quantum Logic: Part 5
6) Equivalence of the Foulis-Holland Theorems and the Orthomodular Law in Quantum Logic: Part 6
7) Equivalence of the Foulis-Holland Theorems and the Orthomodular Law in Quantum Logic: Part 7
Session: Grammar Rules And Text Compression Methods
1) Improving Compression Performance with a Star Encoding Front End: A Linguistic Comparison
2) Automated Semantics Treatment of Sequence Diagram Defining Grammar Rules

最近チェックした商品