检索结果-内蒙古大学图书馆

international conference on Computer Communications and Networks (ICCCN)

作者： Ting-Yu Lin Kang-Lun Fan Department of Communication Engineering National Chiao Tung University Taiwan

Most earlier works in the area of wireless mesh network assume a single interface being equipped in each node. In this paper, we consider the next-generation wireless mesh networks in which each node may be equipped with multiple radio interfaces, each capable of running in one of several modes, one of several channels, and each capable of supporting multiple modulations. For example, from off-the-shelf components, one can easily construct a mesh node with multiple IEEE 802.11a/b/g radio interfaces. Our goal is to address the resource planning and packet forwarding issues in such an environment. the proposed methodology is based on linear programming with network flow principles and radio channel access/interference models. Given a network topology, traffic requirements, and gateway capacities, we show how to allocate network interface cards and their channels to fully utilize channel bandwidths. the results can be used by a wireless Internet service provider to plan their networks under a hardware constraint so as to maximize their profits. To the best of our knowledge, this is the first work addressing resource planning in a wireless mesh network. Our numerical results show significant improvement in terms of aggregate network throughput with moderate network-layer fairness.

关键词： Next generation networking Spread spectrum communication Wireless mesh networks Linear programming Interference Network topology Telecommunication traffic Traffic control Network interfaces Bandwidth

来源：评论

学校读者我要写书评

暂无评论

TURTLE++ –a CIP-library for C++ 16th

引用

16th international conference on Applications of Declarative programming and Knowledge Management, INAP 2005

作者： Hofstedt, Petra Krzikalla, Olaf Technical University of Berlin

ISBN: (纸本)9783540692331

this article introduces the turtle++ library which combines constraint-based and imperative paradigms and enables in this way constraint imperative programming (CIP) with c++. Integrating CIP into c++ allows to exploit the powerful expressiveness of the CIP paradigm within a language widely used and accepted in practice. We discuss the main concepts and implementation and illustrate programming with turtle++ by means of typical examples. © Springer-Verlag Berlin Heidelberg 2006.

关键词： C++ (programming language)

来源：评论

学校读者我要写书评

暂无评论

Symmetry definitions for constraint satisfaction problems

引用

constraintS 2006年第2-3期11卷 115-137页

作者： Cohen, David Jeavons, Peter Jefferson, Christopher Petrie, Karen E. Smith, Barbara M. Natl Univ Ireland Univ Coll Cork Cork Constraint Computat Ctr Cork Ireland Univ London Royal Holloway Dept Comp Sci London England Univ Oxford Comp Lab Oxford OX1 3QD England Univ St Andrews Sch Comp Sci St Andrews KY16 9AJ Fife Scotland

We review the many different definitions of symmetry for constraint satisfaction problems (CSPs) that have appeared in the literature, and show that a symmetry can be defined in two fundamentally different ways: as an operation preserving the solutions of a CSP instance, or else as an operation preserving the constraints. We refer to these as solution symmetries and constraint symmetries. We define a constraint symmetry more precisely as an automorphism of a hypergraph associated with a CSP instance, the microstructure complement. We show that the solution symmetries of a CSP instance can also be obtained as the automorphisms of a related hypergraph, the k-ary nogood hypergraph and give examples to show that some instances have many more solution symmetries than constraint symmetries. Finally, we discuss the practical implications of these different notions of symmetry.

关键词： constraint satisfaction problems symmetry

来源：评论

学校读者我要写书评

暂无评论

Symmetry definitions for constraint satisfaction problems

引用

11th international conference on principles and practice of constraint programming (CP 2005)

ISBN: (纸本)3540292381

关键词： constraint satisfaction problems symmetry

来源：评论

学校读者我要写书评

暂无评论

Two contributions of constraint programming to machine learning

引用

16th European conference on Machine Learning (ECML)/9th European conference on principles and practice of Knowledge Discovery in Databases (PKDD)

作者： Lallouet, A Legtchenko, A Univ Orleans LIFO F-45067 Orleans France

ISBN: (纸本)3540292438

A constraint is a relation with an active behavior. For a given relation, we propose to learn a representation adapted to this active behavior. It yields two contributions. the first is a generic metatechnique for classifier improvement showing performances comparable to boosting. the second lies in the ability of using the learned concept in constraint-based decision or optimization problems. It opens a new way of integrating Machine Learning in Decision Support Systems.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

A SAT-based version space algorithm for acquiring constraint satisfaction problems

引用

16th European conference on Machine Learning (ECML)/9th European conference on principles and practice of Knowledge Discovery in Databases (PKDD)

作者： Bessiere, C Coletta, R Koriche, F O'Sullivan, B Univ Montpellier CNRS LIRMM F-34059 Montpellier France Natl Univ Ireland Univ Coll Cork Cork Constraint Computat Ctr Cork Ireland

ISBN: (纸本)3540292438

constraint programming is rapidly becoming the technology of choice for modelling and solving complex combinatorial problems. However, users of this technology need significant expertise in order to model their problems appropriately. the lack of availability of such expertise is a significant bottleneck to the broader uptake of constraint technology in the real world. We present a new SAT-based version space algorithm for acquiring constraint satisfaction problems from examples of solutions and non-solutions of a target problem. An important advantage is the ease with which domain-specific knowledge can be exploited using the new algorithm. Finally, we empirically demonstrate the algorithm and the effect of exploiting domain-specific knowledge on improving the quality of the acquired constraint network.

关键词： Mathematical programming

来源：评论

学校读者我要写书评

暂无评论

Consistency for quantified constraint satisfaction problems

引用

11th international conference on principles and practice of constraint programming (CP 2005)

作者： Nightingale, P Univ St Andrews Sch Comp Sci St Andrews KY16 9SX Fife Scotland

ISBN: (纸本)3540292381

the generalization of the constraint satisfaction problem with universal quantifiers is a challenging PSPACE-complete problem, which is interesting theoretically and also relevant to solving other PSPACE problems arising in AI, such as reasoning with uncertainty, and multiplayer games. I define two new levels of consistency for QCSP, and give an algorithm to enforce consistency for one of these definitions. the algorithm is embedded in backtracking search, and tested empirically. the aims of this work are to increase the facilities available for modelling and to increase the power of constraint propagation for QCSPs. the work is motivated by examples from adversarial games.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Ad-hoc global constraints for life

引用

11th international conference on principles and practice of constraint programming - CP 2005

作者： Cheng, Kenil C. K. Yap, Roland H. C. National University of Singapore 3 Science Drive 2 Singapore Singapore

ISBN: (纸本)3540292381

Still-life is a challenging problem for CP techniques. We show how to use the global case constraint to construct ad-hoc constraints which can provide stronger propagation than existing CP models. We also demonstrate how to use BDDs to construct good representations for the case constraint which is critical for efficiency. Our results seem comparable to hybrid CP/IP models even though we are only using propagation albeit on ad-hoc global constraints. this is rather promising since it shows the potential of ad-hoc global constraints to do better than IP global constraints. © Springer-Verlag Berlin Heidelberg 2005.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

A constraint based agent for TAC-SCM

引用

11th international conference on principles and practice of constraint programming - CP 2005

作者： Burke, David A. Brown, Kenneth N. Cork Constraint Computation Centre Department of Computer Science University College Cork Ireland

ISBN: (纸本)3540292381

the annual international Trading Agent Competition-Supply Chain Management (TAC-SCM) game is based around the manufacture and supply of PCs. there are multiple agents in the game, scheduling production, competing for orders from customers and components from suppliers. A key decision to be made each day in the game is what offers should be made to customers. Each day, the agents receive a set of request for quotes (RFQ) from customers, agents respond with offers, and then the customers select the lowest bid. We have developed an agent to compete in the competition that combines constraint-based optimisation, reasoning with probabilities, and learning of market conditions in an attempt to determine what customer requests to bid on and what prices to bid. Our agent maintains prices that correspond to different probabilities of success in winning contracts, using an online learning approach. By keeping track of the ratio of offers accepted to those made, the prices can be updated iteratively to move closer to their target probability. this range of price/probability pairs is then used as input to a constraint model. For each request, the model chooses whether or not to bid, and selects a price from the range. these decisions are restricted by capacity and supply constraints. A capacity constraint ensures that we will be able to schedule any new orders we receive with existing orders such that the factory capacity for each day in the current horizon is not exceeded. the agents production ability is also subject to component availability, By ordering components in advance, we know the current amount of components available, and we also know how much of each component will be arriving at each clay. this allows us to add a constraint for availability of supplies. An objective function is specified that maximises our expected profit, where the profit on a request is calculated by subtracting from the selling price the cost of components together with late delivery penalties

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

Methods to learn abstract scheduling models

引用

11th international conference on principles and practice of constraint programming - CP 2005

作者： Carchrae, Tom Beck, J. Christopher Freuder, Eugene C. Cork Constraint Computation Center University College Cork Ireland

ISBN: (纸本)3540292381

For practical reasons, most scheduling problems are an abstraction of the real problem being solved. For example, when you plan your day, you schedule the activities which are critical;that is you schedule the activities which are essential to the success of your day. So you may plan what time to leave the house to get to work, when to have meetings, how you share your vehicle with your spouse and so on. On the other hand, you probably do not consider the activities that are easy to arrange like brushing your teeth, going to the shops, making photocopies and other such tasks that can usually be accomplished whenever you have the time available. Scheduling all of these activities at once is often too complicated. Instead, a simpler schedule is produced by considering only the critical activities. However, if a schedule goes wrong, it is often because an activity turned out to be critical but was not scheduled. We typically learn which activities are critical by experience and create an abstract scheduling problem which includes all known critical activities. Instead of scheduling the non-critical activities we estimate their effects in the abstract scheduling problem. We are interested in automating this abstraction process for scheduling problems. In our approach, given a set of activities A to be scheduled1, we choose a subset of activities, critical(A), and create a simplified scheduling model which approximates the other activities non-critical(A) instead of scheduling them. We then search this abstract model for a good, if not optimal solution. A solution is a partial order schedule for activities in critical(A). this abstract solution is then extended to a solution the entire problem by inserting the remaining activities non-critical(A) into the schedule. While the approach reduces complexity by solving the problem in two stages it does so at a price. there is a risk that the good abstract solution will not produce a good solution to the entire problem. We know

关键词： Problem solving

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：