{"title":"Frontiers in Interpolation and Approximation","authors":"J. Keiner, Jürgen Prestin","doi":"10.1201/9781420011388","DOIUrl":"https://doi.org/10.1201/9781420011388","url":null,"abstract":"","PeriodicalId":53515,"journal":{"name":"Bulletin of the Kyushu Institute of Technology - Pure and Applied Mathematics","volume":"1981 1","pages":"I-XLIII, 1-431"},"PeriodicalIF":0.0,"publicationDate":"2006-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89671871","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Bounds on the domination number domination, independence and irredundance efficiency, redundancy and the duals changing and unchanging domination conditions on the dominating set varieties of domination multiproperty and multiset parameters sums and products of parameters dominating functions frameworks for domination domination complexity and algorithms.
{"title":"Fundamentals of domination in graphs","authors":"T. Haynes, S. Hedetniemi, P. Slater","doi":"10.1201/9781482246582","DOIUrl":"https://doi.org/10.1201/9781482246582","url":null,"abstract":"Bounds on the domination number domination, independence and irredundance efficiency, redundancy and the duals changing and unchanging domination conditions on the dominating set varieties of domination multiproperty and multiset parameters sums and products of parameters dominating functions frameworks for domination domination complexity and algorithms.","PeriodicalId":53515,"journal":{"name":"Bulletin of the Kyushu Institute of Technology - Pure and Applied Mathematics","volume":"18 1","pages":"I-XI, 1-446"},"PeriodicalIF":0.0,"publicationDate":"1998-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74809273","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Employing a closed set-theoretic foundation for interval computations, Global Optimization Using Interval Analysis simplifies algorithm construction and increases generality of interval arithmetic. This Second Edition contains an up-to-date discussion of interval methods for solving systems of nonlinear equations and global optimization problems. It expands and improves various aspects of its forerunner and features significant new discussions, such as those on the use of consistency methods to enhance algorithm performance. Provided algorithms are guaranteed to find and bound all solutions to these problems despite bounded errors in data, in approximations, and from use of rounded arithmetic.
{"title":"Global optimization using interval analysis","authors":"E. Hansen","doi":"10.2307/2153591","DOIUrl":"https://doi.org/10.2307/2153591","url":null,"abstract":"Employing a closed set-theoretic foundation for interval computations, Global Optimization Using Interval Analysis simplifies algorithm construction and increases generality of interval arithmetic. This Second Edition contains an up-to-date discussion of interval methods for solving systems of nonlinear equations and global optimization problems. It expands and improves various aspects of its forerunner and features significant new discussions, such as those on the use of consistency methods to enhance algorithm performance. Provided algorithms are guaranteed to find and bound all solutions to these problems despite bounded errors in data, in approximations, and from use of rounded arithmetic.","PeriodicalId":53515,"journal":{"name":"Bulletin of the Kyushu Institute of Technology - Pure and Applied Mathematics","volume":"61 1","pages":"I-XIII, 1-230"},"PeriodicalIF":0.0,"publicationDate":"1992-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77157723","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1974-03-01DOI: 10.1016/s0079-8169(08)x6030-1
S. Eilenberg
{"title":"Automata, languages, and machines. A","authors":"S. Eilenberg","doi":"10.1016/s0079-8169(08)x6030-1","DOIUrl":"https://doi.org/10.1016/s0079-8169(08)x6030-1","url":null,"abstract":"","PeriodicalId":53515,"journal":{"name":"Bulletin of the Kyushu Institute of Technology - Pure and Applied Mathematics","volume":"3 1","pages":"I-XVI, 1-451"},"PeriodicalIF":0.0,"publicationDate":"1974-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85113610","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：