ISE-TR

• 資料種別: 図書
• タイトル: ISE-TR
• 著者標目: University of Tsukuba. Institute of Information Sciences and Electronics
• 出版事項: Institute of Information Sciences and Electronics, University of Tsukuba
• 大きさ: 30 cm
• 出版地（国名コード）: ja
• 対象利用者: 一般
• 関連情報: XLearner : a system to learn XML queries from examples; https://cir.nii.ac.jp/crid/1130000793655883136; A paradox in distributed optimization of performance; https://cir.nii.ac.jp/crid/1130000794110055808; Generalized (C, A, B)-pair and robust disturbance-rejection problem with dynamic compensator; https://cir.nii.ac.jp/crid/1130000794254638464; Parallel graph computation using autonomous objects; https://cir.nii.ac.jp/crid/1130000794340272384; The singular resolvent with applications; https://cir.nii.ac.jp/crid/1130000794806731776; KnowledgeWeb; https://cir.nii.ac.jp/crid/1130000795258739072; Uniqueness of solutions for optimal static routing in multi-class open networks; https://cir.nii.ac.jp/crid/1130000795304055680; A projection method for generalized eigenvalue problems; https://cir.nii.ac.jp/crid/1130000795304964864; Generalized controlled and conditioned invariances for linear ω-periodic discrete-time systems; https://cir.nii.ac.jp/crid/1130000795330781696; Continual neighborhood tracking for moving objects using adaptive distances; https://cir.nii.ac.jp/crid/1130000795360649472; A characterization of paradoxes in distributed optimization of performance for multiplicated systems; https://cir.nii.ac.jp/crid/1130000795752891008; Braess-like paradoxes of nash equilibria for load balancing in distributed computer systems; https://cir.nii.ac.jp/crid/1130000795763283328; Successive pursuit with a restricted detection domain; https://cir.nii.ac.jp/crid/1130000795901338112; Japan-Tunisia Workshop on Informatics : JTWIN 2001 : University of Tsukuba, October 25-26, 2001; https://cir.nii.ac.jp/crid/1130000795985498624; A global optimization method, QBB, for twice-differentiable nonconvex optimization problem; https://cir.nii.ac.jp/crid/1130000796381870208; A simplicial algorithm with two-phase bounding operation for a class of concave minimization problems; https://cir.nii.ac.jp/crid/1130000796419652224; Numerical studies on Braess-like paradoxes in load balacing; https://cir.nii.ac.jp/crid/1130000796421785728; A Lagrangian based branch-and-bound algorithm for production-transportation problems; https://cir.nii.ac.jp/crid/1130000796556346624; Selective tail call elimination; https://cir.nii.ac.jp/crid/1130000796566781568; Analytic study of distributed optima coexisting within a network of homogeneous computers; https://cir.nii.ac.jp/crid/1130000796596251136; Adaptive automation : sharing and trading of control; https://cir.nii.ac.jp/crid/1130000796761965696; A simple pursuit game with an obstacle between players; https://cir.nii.ac.jp/crid/1130000797461420928; A disturbance-rejection problem with minimal order dynamic compensator for linear ω-periodic discrete-time systems; https://cir.nii.ac.jp/crid/1130000797487570432; A simplicial branch-and-bound algorithm for production-transportation problems with inseparable concave production cost; https://cir.nii.ac.jp/crid/1130000797568929792; A branch-and-bound algorithm for maximizing the sum of several linear ratios; https://cir.nii.ac.jp/crid/1130000798072553984; Algebraic service specification and rule generation for integrating multiple dissemination-based information sources; https://cir.nii.ac.jp/crid/1130282269130148992; Inefficiency of Nash equilibria in networking games of common-pool resources; https://cir.nii.ac.jp/crid/1130282269462870656; A performance comparison of dynamic vs. static load balancing policies in a mainframe-personal computer network model; https://cir.nii.ac.jp/crid/1130282269500549504; Linear programs with an additional separable concave constraint; https://cir.nii.ac.jp/crid/1130282269847040640; Global optimization of nonconvex MINLP by a hybrid Branch-and-bound and revised general Benders decomposition method; https://cir.nii.ac.jp/crid/1130282270810253568; The worst ratio of paradoxical cost degradation in the Braess network; https://cir.nii.ac.jp/crid/1130282270908916352; Refinements of lazy narrowing for left-linear fully-extended pattern rewrite systems; https://cir.nii.ac.jp/crid/1130282271064242432; Splitting correction preconditioner for linear systems that arise from periodic boundary problems; https://cir.nii.ac.jp/crid/1130282271194312192; Drag and drop : amalgamation of authoring, querying, and restructuring for multimedia view construction; https://cir.nii.ac.jp/crid/1130282271199937408; SoftwarePot : an encapsulated transferable file system for secure software circulation; https://cir.nii.ac.jp/crid/1130282271579551744; Abstract machine approach to operational semantics of Prolog; https://cir.nii.ac.jp/crid/1130282271881198848; A revision of the trapezoidal branch-and-bound algorithm for linear sum-of-rations problems; https://cir.nii.ac.jp/crid/1130282271903055872; Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set; https://cir.nii.ac.jp/crid/1130282272032145920; The subtraction problem generating; https://cir.nii.ac.jp/crid/1130282272162847744; A secure access control mechanism against internet crackers; https://cir.nii.ac.jp/crid/1130282272182063360; Dynamic selection of L for Bi-CGSTAB(L); https://cir.nii.ac.jp/crid/1130282272239064832; LNCA : a lazy narrowing calculus for applicative term rewriting systems; https://cir.nii.ac.jp/crid/1130282272337251584; Human-computer interaction and cooperation for supervisory control of large-complex systems; https://cir.nii.ac.jp/crid/1130282272492002304; A disjunctive cutting plane based branch-and-cut algorithm for 0-1 mixed-integer nonlinear programs; https://cir.nii.ac.jp/crid/1130282272545198080; Bounds on benefits and harms of adding connections to noncooperative networks; https://cir.nii.ac.jp/crid/1130282272838570624; Confluence of orthogonal higher-order rewrite systems : proof by parallel moves; https://cir.nii.ac.jp/crid/1130282272879006208; Polynomial algorithms for a class of minimum rank-two cost path problems; https://cir.nii.ac.jp/crid/1130282272898957056; An approach to mobile software robots for the WWW; https://cir.nii.ac.jp/crid/1130282273051895296; A finite branch-and-bound algorithm for linear multiplicative programming; https://cir.nii.ac.jp/crid/1130282273127736320
• 関連情報（URI）: https://ci.nii.ac.jp/ncid/BA14260036#entity
• 連携機関・データベース: 国立情報学研究所 : CiNii Research
• 提供元機関・データベース: CiNii Books; https://ci.nii.ac.jp/books
• NACSIS書誌ID（NCID）: https://ci.nii.ac.jp/ncid/BA14260036 : BA14260036

目次

XLearner : a system to learn XML queries from examples

A paradox in distributed optimization of performance

Generalized (C, A, B)-pair and robust disturbance-rejection problem with dynamic compensator

Parallel graph computation using autonomous objects

The singular resolvent with applications