JP4707760B2 - 並列化制約充足問題ソルバにおけるLock−free状態併合 - Google Patents
並列化制約充足問題ソルバにおけるLock−free状態併合 Download PDFInfo
- Publication number
- JP4707760B2 JP4707760B2 JP2009537409A JP2009537409A JP4707760B2 JP 4707760 B2 JP4707760 B2 JP 4707760B2 JP 2009537409 A JP2009537409 A JP 2009537409A JP 2009537409 A JP2009537409 A JP 2009537409A JP 4707760 B2 JP4707760 B2 JP 4707760B2
- Authority
- JP
- Japan
- Prior art keywords
- solver
- graph
- support
- state
- parallel
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000012545 processing Methods 0.000 claims description 83
- 238000000034 method Methods 0.000 claims description 73
- 238000011156 evaluation Methods 0.000 claims description 3
- 230000008569 process Effects 0.000 description 36
- 238000010586 diagram Methods 0.000 description 20
- 238000004891 communication Methods 0.000 description 19
- 230000006870 function Effects 0.000 description 14
- 230000014509 gene expression Effects 0.000 description 13
- 238000003860 storage Methods 0.000 description 13
- DBGIVFWFUFKIQN-UHFFFAOYSA-N (+-)-Fenfluramine Chemical compound CCNC(C)CC1=CC=CC(C(F)(F)F)=C1 DBGIVFWFUFKIQN-UHFFFAOYSA-N 0.000 description 11
- 238000004422 calculation algorithm Methods 0.000 description 9
- 230000003287 optical effect Effects 0.000 description 7
- 238000005516 engineering process Methods 0.000 description 6
- 230000009471 action Effects 0.000 description 5
- 238000004458 analytical method Methods 0.000 description 4
- 239000003795 chemical substances by application Substances 0.000 description 4
- 238000012423 maintenance Methods 0.000 description 4
- 238000012706 support-vector machine Methods 0.000 description 4
- 230000003139 buffering effect Effects 0.000 description 3
- 238000004364 calculation method Methods 0.000 description 3
- 230000008859 change Effects 0.000 description 3
- 235000014510 cooky Nutrition 0.000 description 3
- 238000000354 decomposition reaction Methods 0.000 description 3
- 238000009795 derivation Methods 0.000 description 3
- 230000006855 networking Effects 0.000 description 3
- 230000009467 reduction Effects 0.000 description 3
- 238000012549 training Methods 0.000 description 3
- 125000002015 acyclic group Chemical group 0.000 description 2
- 230000001351 cycling effect Effects 0.000 description 2
- 238000013461 design Methods 0.000 description 2
- 238000009826 distribution Methods 0.000 description 2
- 230000009977 dual effect Effects 0.000 description 2
- 230000007246 mechanism Effects 0.000 description 2
- 230000002093 peripheral effect Effects 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- 230000001902 propagating effect Effects 0.000 description 2
- 230000001133 acceleration Effects 0.000 description 1
- 230000004075 alteration Effects 0.000 description 1
- 238000013459 approach Methods 0.000 description 1
- 238000013528 artificial neural network Methods 0.000 description 1
- 230000003190 augmentative effect Effects 0.000 description 1
- 230000006399 behavior Effects 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 230000001364 causal effect Effects 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 230000000295 complement effect Effects 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 238000003066 decision tree Methods 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000003745 diagnosis Methods 0.000 description 1
- 230000008030 elimination Effects 0.000 description 1
- 238000003379 elimination reaction Methods 0.000 description 1
- 238000009434 installation Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000005055 memory storage Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 238000002360 preparation method Methods 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 238000007619 statistical method Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
- 230000009466 transformation Effects 0.000 description 1
- 238000000844 transformation Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/30—Creation or generation of source code
- G06F8/31—Programming languages or programming paradigms
- G06F8/314—Parallel programming languages
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F15/00—Digital computers in general; Data processing equipment in general
- G06F15/16—Combinations of two or more digital computers each having at least an arithmetic unit, a program unit and a register, e.g. for a simultaneous processing of several programs
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/30—Creation or generation of source code
- G06F8/31—Programming languages or programming paradigms
- G06F8/313—Logic programming, e.g. PROLOG programming language
- G06F8/3135—Unification or backtracking
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5061—Partitioning or combining of resources
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N5/00—Computing arrangements using knowledge-based models
- G06N5/01—Dynamic search techniques; Heuristics; Dynamic trees; Branch-and-bound
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N20/00—Machine learning
- G06N20/10—Machine learning using kernel methods, e.g. support vector machines [SVM]
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computing arrangements based on biological models
- G06N3/02—Neural networks
- G06N3/08—Learning methods
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N5/00—Computing arrangements using knowledge-based models
- G06N5/04—Inference or reasoning models
- G06N5/048—Fuzzy inferencing
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N7/00—Computing arrangements based on specific mathematical models
- G06N7/01—Probabilistic graphical models, e.g. probabilistic networks
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Physics & Mathematics (AREA)
- Computing Systems (AREA)
- Data Mining & Analysis (AREA)
- Evolutionary Computation (AREA)
- Mathematical Physics (AREA)
- Computational Linguistics (AREA)
- Artificial Intelligence (AREA)
- Computer Hardware Design (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Description
ω1≡(¬x1∨x2)
ω2≡(¬x1∨x3∨x9)
ω3≡(¬x2∨¬x3∨x4)
ω4≡(¬x4∨x5∨x10)
ω5≡(¬x4∨x6∨x11)
ω6≡(¬x5∨¬x6)
ω7≡(x1∨x7∨¬x12)
ω8≡(x1∨x8)
ω9≡(¬x7∨¬x8∨¬x13)
を含む初期の1組の制約C、および仮定の現在のスタックから開始する。演繹グラフ400では、仮定が仮定ノードとしてモデル化され、それらのノードは、入力アークを有していない。したがって、グラフ400に関する仮定は、
x1@{x1}、
¬x9@{¬x9}、
¬x10@{¬x10}、および
¬x11@{¬x11}、
を含む。グラフ400は、4つの仮定ノード、すなわち、x1に真(たとえば、x1)が割り当てられている第1の仮定ノード402と、x9に偽(たとえば、¬x9)が割り当てられている第2の仮定ノード404と、x10に偽(たとえば、¬x10)が割り当てられている第3の仮定ノード406と、x11に偽(たとえば、¬x11)が割り当てられている第4の仮定ノード408とを含む。
ωC(κ(ω6))≡¬(x1∧¬x9∧¬x10∧¬x11)
を出力し、上式で、κ(カッパ)は「競合」を表し、制約は、何がうまくいかなかったかのレポートである。ここで、出力ωC(κ(ω6))は、同時にx1が真、x9が偽、x10が偽、x11が偽であることができず、それらのうちの1つを、さらに処理するために放棄しなければならないことを示す。これは、x1ではなく、またはx9、またはx10、またはx11と等価であり、これは正しい形態にある。図5は、図4のサポートグラフから出力された競合する制約を処理するための新しいグラフ500を示す。上記の4つのうちの3つ(たとえば、¬x9、¬x10、¬x11)について仮定を選択することにより、新しいグラフ500、およびさらに別の新しく導出された制約
ωC(κ(ω9))≡¬(¬x9∧¬x10∧¬x11∧x12∧x13)
が生み出される。
CG,G'は、グラフGおよびG’に共通の仮定の集合である。
AGは、Gの仮定の集合である。
DGは、Gの推論値の集合である。
AG,G'は、G’の推論値であるGの仮定の集合である。
BG,G'は、G’に述べられていないGの仮定の集合である。
AG=CG,G'∪AG,G'∪BG,G'
AG'=CG,G'∪AG',G∪BG',G
Claims (10)
- 制約ソルバ処理を実行する、コンピュータによって実施されるシステムであって、
計算スレッドの入力ソルバ状態を1セットのサポートグラフとして表すためのブックキーピングコンポーネントであって、前記入力ソルバ状態は、前記計算スレッドの処理に関連し、前記計算スレッドに作用している並列ソルバから受け取られ、前記サポートグラフは、リテラルを有する複数のノードと、前記並列ソルバに関連付けられた制約とを含み、前記複数のノードから前記制約を充足するリテラルが仮定される、ブックキーピングコンポーネントと、
受け取ったサポートグラフのうちで同じリテラルを有するノードを併合するように、前記受け取ったサポートグラフを対ごとに併合し、前記計算スレッドの最終状態を表す併合済みグラフにするためのマージコンポーネントであって、前記併合済みグラフは、前記サポートグラフの対に含まれるノードを含む、マージコンポーネントと、
前記並列ソルバに関して、複数の学習済み制約を加え、前記併合済みグラフに含まれるノードのリテラルが前記併合済みグラフの制約を充足しない場合、中間の仮定を変更せず以前のノードを除去するための伝播コンポーネントと
を備えることを特徴とするシステム。 - 前記ブックキーピングコンポーネントは、前記計算スレッドに作用している並列ブール充足可能性(SAT)ソルバから前記入力ソルバ状態を受け取ることを特徴とする請求項1に記載のシステム。
- 前記ブックキーピングコンポーネントは、前記計算スレッドに作用しているCSPソルバから前記入力ソルバ状態を受け取ることを特徴とする請求項1に記載のシステム。
- 前記CSPソルバが、評価の束Aおよび1組の値Dに従って定義され、ただしDおよびAは同じ集合の要素であることを特徴とする請求項3に記載のシステム。
- 推測値に基づいて変数の割当てを推論する、学習および推理コンポーネントをさらに備えることを特徴とする請求項1に記載のシステム。
- 前記入力ソルバ状態は、前記計算スレッドに作用している2つの並列SATソルバからのものであり、前記マージコンポーネントは、n個の新しい、異なるリテラルを前記サポートグラフのn個のコピーのそれぞれに加え、ただしnは正の整数であることを特徴とする請求項1に記載のシステム。
- 制約ソルバ処理の、コンピュータによって実施される方法であって、
計算スレッドの入力ソルバ状態を1セットのサポートグラフとして表すステップと、
並列ソルバの、前記計算スレッドの処理に関連する前記入力ソルバ状態に関連する前記サポートグラフを受け取るステップであって、前記サポートグラフは、リテラルを有する複数のノードと、前記並列ソルバに関連付けられた制約とを含み、前記複数のノードから前記制約を充足するリテラルが仮定される、ステップと、
受け取ったサポートグラフのうちで同じリテラルを有するノードを併合するように、前記受け取ったサポートグラフを対ごとに併合し、前記計算スレッドの最終状態を表す併合済みグラフにするステップであって、前記併合済みグラフは、前記サポートグラフの対に含まれるノードを含む、ステップと、
前記並列ソルバに関して、複数の学習済み制約を加えるステップと、
前記併合済みグラフに含まれるノードのリテラルが前記併合済みグラフの制約を充足しない場合、中間の仮定を変更せず以前のノードを除去するステップと
を含むことを特徴とする方法。 - 前記並列ソルバのそれぞれの前記サポートグラフを同時に操作するステップをさらに含むことを特徴とする請求項7に記載の方法。
- 残りのリテラルを、仮定として指定するステップと
をさらに含むことを特徴とする請求項7に記載の方法。 - 前記並列ソルバはブールSATソルバであることを特徴とする請求項7に記載の方法。
Applications Claiming Priority (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US11/602,092 US7543266B2 (en) | 2006-11-20 | 2006-11-20 | Lock-free state merging in parallelized constraint satisfaction problem solvers |
US11/602,092 | 2006-11-20 | ||
PCT/US2007/085149 WO2008064185A1 (en) | 2006-11-20 | 2007-11-19 | Lock-free state merging in parallelized constraint satisfaction problem solvers |
Publications (3)
Publication Number | Publication Date |
---|---|
JP2010510591A JP2010510591A (ja) | 2010-04-02 |
JP2010510591A5 JP2010510591A5 (ja) | 2010-12-02 |
JP4707760B2 true JP4707760B2 (ja) | 2011-06-22 |
Family
ID=39418265
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
JP2009537409A Active JP4707760B2 (ja) | 2006-11-20 | 2007-11-19 | 並列化制約充足問題ソルバにおけるLock−free状態併合 |
Country Status (8)
Country | Link |
---|---|
US (1) | US7543266B2 (ja) |
EP (1) | EP2084615B1 (ja) |
JP (1) | JP4707760B2 (ja) |
KR (1) | KR101432328B1 (ja) |
CN (1) | CN101542460B (ja) |
CA (1) | CA2668121C (ja) |
IL (1) | IL197775A (ja) |
WO (1) | WO2008064185A1 (ja) |
Families Citing this family (24)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7987352B2 (en) * | 2007-11-30 | 2011-07-26 | Intel Corporation | Booting with sub socket partitioning |
US20100057647A1 (en) * | 2008-09-04 | 2010-03-04 | Microsoft Corporation | Accommodating learned clauses in reconfigurable hardware accelerator for boolean satisfiability solver |
CN101685408B (zh) * | 2008-09-24 | 2013-10-09 | 国际商业机器公司 | 多个线程并行访问共享数据结构的方法及装置 |
US20100169618A1 (en) * | 2008-12-30 | 2010-07-01 | Microsoft Corporation | Identifying concurrency control from a sequential proof |
US8346704B2 (en) * | 2009-05-13 | 2013-01-01 | Microsoft Corporation | Controlled constraint sharing in parallel problem solvers |
US9031890B2 (en) * | 2010-08-04 | 2015-05-12 | Sherwin Han | Inverse function method of boolean satisfiability (SAT) |
CN102467583B (zh) * | 2010-10-29 | 2014-07-23 | 国际商业机器公司 | 追踪不确定信号的方法和装置 |
US8413091B2 (en) | 2011-04-22 | 2013-04-02 | International Business Machines Corporation | Enhancing redundancy removal with early merging |
US8589327B2 (en) | 2011-04-22 | 2013-11-19 | International Business Machines Corporation | Efficiently determining boolean satisfiability with lazy constraints |
US8738554B2 (en) | 2011-09-16 | 2014-05-27 | International Business Machines Corporation | Event-driven universal neural network circuit |
US8874498B2 (en) | 2011-09-16 | 2014-10-28 | International Business Machines Corporation | Unsupervised, supervised, and reinforced learning via spiking computation |
US8799199B2 (en) | 2011-12-14 | 2014-08-05 | International Business Machines Corporation | Universal, online learning in multi-modal perception-action semilattices |
US8626684B2 (en) | 2011-12-14 | 2014-01-07 | International Business Machines Corporation | Multi-modal neural network for universal, online learning |
US8676866B2 (en) * | 2012-03-19 | 2014-03-18 | Sap Ag | Computing canonical hierarchical schemas |
CN104395900B (zh) | 2013-03-15 | 2017-08-25 | 北京未名博思生物智能科技开发有限公司 | 序列比对的空间计数运算方法 |
CN105190632B (zh) | 2013-04-04 | 2018-06-05 | 韩小文 | 构造非确定性(np)图灵机的多项式方法 |
US9311429B2 (en) | 2013-07-23 | 2016-04-12 | Sap Se | Canonical data model for iterative effort reduction in business-to-business schema integration |
FI20135946L (fi) * | 2013-09-23 | 2015-03-24 | Procomp Solutions Oy | Rinnakkainen ratkaisun muodostaminen |
US11481468B2 (en) * | 2014-06-03 | 2022-10-25 | Qualcomm Technologies, Inc. | Systems and methods for solving unrestricted incremental constraint problems |
US9418137B2 (en) * | 2014-08-29 | 2016-08-16 | Sherwin Han | Database without structured query language |
US9424103B2 (en) * | 2014-09-30 | 2016-08-23 | Hong Kong Applied Science and Technology Research Institute Company Limited | Adaptive lock for a computing system having multiple runtime environments and multiple processing units |
US10540477B2 (en) * | 2016-05-02 | 2020-01-21 | Siemens Industry Software Nv | Space modeling language for the generation of engineering designs |
CN106201988A (zh) * | 2016-08-03 | 2016-12-07 | 桂林电子科技大学 | 一种重构高性能目标阵列的方法 |
KR20200083048A (ko) * | 2018-12-31 | 2020-07-08 | 삼성전자주식회사 | 폴링 시간을 예측하는 뉴럴 네트워크 시스템 및 이를 이용한 뉴럴 네트워크 모델 처리 방법 |
Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2004513435A (ja) * | 2000-11-03 | 2004-04-30 | ベリシティ リミテッド | 静的解析を使用する動的制約条件付きテスト生成のためのシステムおよび方法 |
Family Cites Families (16)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4918621A (en) | 1986-08-13 | 1990-04-17 | Intellicorp, Inc. | Method for representing a directed acyclic graph of worlds using an assumption-based truth maintenance system |
JPH0789220B2 (ja) * | 1987-05-28 | 1995-09-27 | 富士写真フイルム株式会社 | 版材焼付装置 |
US5276775A (en) | 1990-12-07 | 1994-01-04 | Texas Instruments Inc. | System and method for building knowledge-based applications |
JPH0785748B2 (ja) * | 1991-08-06 | 1995-09-20 | 三郎 狩野 | ゴルフ場のピンに付設する標示体 |
US5469367A (en) * | 1994-06-06 | 1995-11-21 | University Technologies International Inc. | Methodology and apparatus for modular partitioning for the machine design of asynchronous circuits |
JPH10275084A (ja) * | 1997-03-31 | 1998-10-13 | Toshiba Corp | 制約充足問題の解決装置及び解決方法、システム構築装置及び構築方法 |
US6038392A (en) * | 1998-05-27 | 2000-03-14 | Nec Usa, Inc. | Implementation of boolean satisfiability with non-chronological backtracking in reconfigurable hardware |
US7085748B2 (en) * | 2001-02-16 | 2006-08-01 | International Business Machines Corporation | Hyper-arc consistency in a contraint satisfaction network |
US7418369B2 (en) | 2001-09-07 | 2008-08-26 | The Trustees Of Princeton University | Method and system for efficient implementation of boolean satisfiability |
US7203917B2 (en) * | 2003-04-07 | 2007-04-10 | Nec Laboratories America, Inc. | Efficient distributed SAT and SAT-based distributed bounded model checking |
US7089220B2 (en) * | 2003-06-24 | 2006-08-08 | Palo Alto Research Center Incorporated | Complexity-directed cooperative problem solving |
US7171393B2 (en) | 2003-07-22 | 2007-01-30 | International Business Machines Corporation | Solving constraint satisfaction problems using variable-range hopping |
US7194710B2 (en) | 2004-03-23 | 2007-03-20 | Fujitsu Limited | Scheduling events in a boolean satisfiability (SAT) solver |
GB0407260D0 (en) | 2004-03-31 | 2004-05-05 | Ibm | Accelerated solution of constraint satisfaction problems by partioning of the variable space |
US7370296B2 (en) | 2004-05-25 | 2008-05-06 | International Business Machines Corporation | Modeling language and method for address translation design mechanisms in test generation |
TW200622904A (en) | 2004-08-12 | 2006-07-01 | Sandbridge Technologies Inc | Method for recognition of acyclic instruction patterns |
-
2006
- 2006-11-20 US US11/602,092 patent/US7543266B2/en active Active
-
2007
- 2007-11-19 CA CA2668121A patent/CA2668121C/en not_active Expired - Fee Related
- 2007-11-19 JP JP2009537409A patent/JP4707760B2/ja active Active
- 2007-11-19 WO PCT/US2007/085149 patent/WO2008064185A1/en active Application Filing
- 2007-11-19 KR KR1020097007032A patent/KR101432328B1/ko active IP Right Grant
- 2007-11-19 CN CN2007800428239A patent/CN101542460B/zh active Active
- 2007-11-19 EP EP07854702.3A patent/EP2084615B1/en active Active
-
2009
- 2009-03-24 IL IL197775A patent/IL197775A/en active IP Right Grant
Patent Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2004513435A (ja) * | 2000-11-03 | 2004-04-30 | ベリシティ リミテッド | 静的解析を使用する動的制約条件付きテスト生成のためのシステムおよび方法 |
Also Published As
Publication number | Publication date |
---|---|
CA2668121A1 (en) | 2008-05-29 |
IL197775A0 (en) | 2009-12-24 |
WO2008064185A1 (en) | 2008-05-29 |
CA2668121C (en) | 2015-04-21 |
KR101432328B1 (ko) | 2014-08-20 |
EP2084615A1 (en) | 2009-08-05 |
CN101542460B (zh) | 2012-03-21 |
EP2084615A4 (en) | 2012-08-01 |
IL197775A (en) | 2013-07-31 |
JP2010510591A (ja) | 2010-04-02 |
US20080120490A1 (en) | 2008-05-22 |
EP2084615B1 (en) | 2017-10-25 |
KR20090085028A (ko) | 2009-08-06 |
US7543266B2 (en) | 2009-06-02 |
CN101542460A (zh) | 2009-09-23 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
JP4707760B2 (ja) | 並列化制約充足問題ソルバにおけるLock−free状態併合 | |
US8005770B2 (en) | Parallel generation of a bayesian network | |
EP2175369A2 (en) | Concurrent collaborative processes for data management and retrieval | |
CN110348798A (zh) | 一组服务的状态转换 | |
Stein et al. | Algorithms and mechanisms for procuring services with uncertain durations using redundancy | |
Groote et al. | Modelling and analysing software in mCRL2 | |
van Dijk | Sylvan: multi-core decision diagrams | |
Inan et al. | Verification of digital and hybrid systems | |
Djenouri et al. | GPU-based swarm intelligence for Association Rule Mining in big databases | |
Yang et al. | Projected model counting: Beyond independent support | |
Straub | Assessment of the comparative efficiency of software‐based Boolean, electronic, software‐based fractional value and simplified quantum principal expert systems | |
Bowles et al. | Correct composition of dephased behavioural models | |
Bortolussi et al. | Fluid performability analysis of nested automata models | |
Silva et al. | Parallel asynchronous strategies for the execution of feature selection algorithms | |
Paige | Automatic inference for higher-order probabilistic programs | |
Schütt et al. | MR‐search: massively parallel heuristic search | |
Flocchini et al. | Gathering and election by mobile robots in a continuous cycle | |
Abdulla | Regular model checking: Evolution and perspectives | |
Timm et al. | Model checking and strategy synthesis for multi-agent systems for resource allocation | |
Brand et al. | A decision diagram operation for reachability | |
Jha et al. | When a Graph is not so Simple: Counting Triangles in Multigraph Streams. | |
Chen et al. | A parallel algorithm for exact Bayesian structure discovery in Bayesian networks | |
Prabhu et al. | Parallel Exploration of Directed Acyclic Graphs using the Actor Model | |
Combarro et al. | Solving the Kemeny ranking aggregation problem with quantum optimization algorithms | |
Karan et al. | End-to-End Bayesian Networks Exact Learning in Shared Memory |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
A521 | Request for written amendment filed |
Free format text: JAPANESE INTERMEDIATE CODE: A523 Effective date: 20101015 |
|
A621 | Written request for application examination |
Free format text: JAPANESE INTERMEDIATE CODE: A621 Effective date: 20101015 |
|
A871 | Explanation of circumstances concerning accelerated examination |
Free format text: JAPANESE INTERMEDIATE CODE: A871 Effective date: 20101015 |
|
A975 | Report on accelerated examination |
Free format text: JAPANESE INTERMEDIATE CODE: A971005 Effective date: 20101105 |
|
A131 | Notification of reasons for refusal |
Free format text: JAPANESE INTERMEDIATE CODE: A131 Effective date: 20101112 |
|
A521 | Request for written amendment filed |
Free format text: JAPANESE INTERMEDIATE CODE: A523 Effective date: 20110214 |
|
TRDD | Decision of grant or rejection written | ||
A01 | Written decision to grant a patent or to grant a registration (utility model) |
Free format text: JAPANESE INTERMEDIATE CODE: A01 Effective date: 20110308 |
|
A61 | First payment of annual fees (during grant procedure) |
Free format text: JAPANESE INTERMEDIATE CODE: A61 Effective date: 20110315 |
|
R150 | Certificate of patent or registration of utility model |
Ref document number: 4707760 Country of ref document: JP Free format text: JAPANESE INTERMEDIATE CODE: R150 |
|
R250 | Receipt of annual fees |
Free format text: JAPANESE INTERMEDIATE CODE: R250 |
|
R250 | Receipt of annual fees |
Free format text: JAPANESE INTERMEDIATE CODE: R250 |
|
S111 | Request for change of ownership or part of ownership |
Free format text: JAPANESE INTERMEDIATE CODE: R313113 |
|
R350 | Written notification of registration of transfer |
Free format text: JAPANESE INTERMEDIATE CODE: R350 |
|
R250 | Receipt of annual fees |
Free format text: JAPANESE INTERMEDIATE CODE: R250 |
|
R250 | Receipt of annual fees |
Free format text: JAPANESE INTERMEDIATE CODE: R250 |
|
R250 | Receipt of annual fees |
Free format text: JAPANESE INTERMEDIATE CODE: R250 |
|
R250 | Receipt of annual fees |
Free format text: JAPANESE INTERMEDIATE CODE: R250 |
|
R250 | Receipt of annual fees |
Free format text: JAPANESE INTERMEDIATE CODE: R250 |
|
R250 | Receipt of annual fees |
Free format text: JAPANESE INTERMEDIATE CODE: R250 |
|
R250 | Receipt of annual fees |
Free format text: JAPANESE INTERMEDIATE CODE: R250 |
|
R250 | Receipt of annual fees |
Free format text: JAPANESE INTERMEDIATE CODE: R250 |
|
R250 | Receipt of annual fees |
Free format text: JAPANESE INTERMEDIATE CODE: R250 |