نتایج جستجو برای: server assignment

تعداد نتایج: 96037  

2007
Qixin Wang Xue Liu Jennifer Hou Lui Sha

The convergence of computer and physical world calls for next generation Wide Area Network (WAN) infrastructures for hard real-time and embedded applications. Such networks need virtual topologies to achieve scalability, configurability, and flexibility. Virtual topologies are made of virtual links, for which, the state-of-the-art building tool is Guaranteed Rate server based aggregates (GR-agg...

2006
Zhe George Zhang Naishuo Tian Ernie Love

This paper addresses an important question of how to achieve an appropriate and nearly uniform work-load for an under-utilized staff in a waiting line situation by scheduling an appropriate amount of supplementary work during the idle time. We present an M/G/1 queue with a special server’s vacation policy to model this situation. In this system, after serving all arriving customers, the server...

2008
Ioannis Caragiannis Christos Kaklamanis Panagiotis Kanellopoulos

In load balancing games, there is a set of available servers and a set of clients; each client wishes to run her job on some server. Clients are selfish and each of them selects a server that, given an assignment of the other clients to servers, minimizes the latency she experiences with no regard to the global optimum. In order to mitigate the effect of selfishness on the efficiency, we assign...

Journal: :JMPT 2011
Martin Rothbucher Matthias Kaufmann Johannes Feldmaier Tim Habigt Marko Durkovic Christoph Kozielski Klaus Diepold

This article describes a system that is able to perform online sound localization, separation and speaker recognition for the purpose of channel assignment in teleconferencing scenarios. The assigned channels are then virtually synthesized to different positions around the listener by a conference server using Head-Related Transfer Functions (HRTFs), which enables the user to identify active sp...

2014
N. Madhu G. Bhaskar Phani Ram J. Krishna Chaitanya K. Harikrishna

This paper describes the Intelligent Energy and Power Management System (IEPMS) to manage power distribution and power consumption in home space. The thought of dynamic assignment of priorities for all the patron is delineate during this paper. Slicing of interrupt timings conjointly mentioned which might be wont to improve the performance and additionally we are able to show the Units of Power...

Journal: :European Journal of Operational Research 2000
K. J. Becker Donald P. Gaver Kevin D. Glazebrook Patricia A. Jacobs Siriphong Lawphongpanich

This paper addresses the problem of scheduling randomly arriving tasks of di€erent types at a diversi®ed service system. Servers at such a system di€er in that each may specialize in one task type, but can also perform others perhaps less rapidly and adequately than does a specialist. We consider the issue of how much redirection of tasks from specialists to non-specialists may be desirable in ...

Journal: :Acta crystallographica. Section D, Biological crystallography 1998
C A Orengo A M Martin G Hutchinson S Jones D T Jones A D Michie M B Swindells J M Thornton

The CATH database of protein domain structures classifies structures according to their (C)lass, (A)rchitecture, (T)opology or fold and (H)omologous family (http://www.biochem.ucl.ac.uk/bsm/cath). Although the protocol used is mostly automatic, manual inspection is used to check assignments at some critical stages, such as the detection of very distantly related homologues and anologues and the...

Journal: :international journal of transportation engineereing 2014
krishna saw b. k. katti g. joshi

rapid urban growth is resulting into increase in travel demand and private vehicle ownership in urban areas. in the present scenario the existing infrastructure has failed to match the demand that leads to traffic congestion, vehicular pollution and accidents. with traffic congestion augmentation on the road, delay of commuters has increased and reliability of road network has decreased. four s...

2012
Hiroshi Tamura Keisuke Nakano Masakazu Sengoku Shoji Shinoda

Graph/network theory results are applicable to problems in communications. As a representative example, the node coloring problem in graph theory is applicable to the channel assignment problem in cellular mobile communication systems. The node coloring problem is NP-complete, meaning that optimally solving it is very difficult. Therefore, we use heuristic algorithms for the channel assignment ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید