Parcourir par sujet "Methods"
Voici les éléments 1-20 de 23
-
Adaptive channel allocation in OFDM/SDMA wireless LANs with limited transceiver resources
(2004)Smart antennas increase capacity of wireless systems by allowing channel reuse by several users in the same cell through space division multiple access (SDMA). Orthogonal Frequency Division Multiplexing (OFDM) creates ... -
Agent-based simulation of data-driven fire propagation dynamics
(2004)Real world problems such as fire propagation prediction, can often be considered as a compositional combination of multiple, simple but coupled subproblems corresponding to analytical and computational behavior models of ... -
Architectural Requirements for Cloud Computing Systems: An Enterprise Cloud Approach
(2011)Cloud Computing is a model of service delivery and access where dynamically scalable and virtualized resources are provided as a service over the Internet. This model creates a new horizon of opportunity for enterprises. ... -
Categorical range queries in large databases
(2003)In this paper, we introduce the categorical (a.k.a. chromatic) range queries (CRQs) in the context of large, disk-resident data sets, motivated by the fact, that CRQs are conceptually simple and emerge often in DBMSs. On ... -
Cross-layer adaptive techniques for throughput enhancement in wireless OFDM-based networks
(2006)Although independent consideration of layers simplifies wireless system design, it is inadequate since: 1) it does not consider the effect of co-channel user interference on higher layers; 2) it does not address the impact ... -
Dynamic-data-driven real-time computational mechanics environment
(2004)The proliferation of sensor networks in various areas of technology has enabled real-time behavioral monitoring of various physical systems in various length and time scales. The opportunity to use these data dynamically ... -
Effective rank aggregation for metasearching
(2011)Nowadays, mashup services and especially metasearch engines play an increasingly important role on the Web. Most of users use them directly or indirectly to access and aggregate information from more than one data sources. ... -
Efficient algorithms for distortion and blocking techniques in association rule hiding
(2007)Data mining provides the opportunity to extract useful information from large databases. Various techniques have been proposed in this context in order to extract this information in the most efficient way. However, ... -
Enhancing Differential Evolution Utilizing Proximity-Based Mutation Operators
(2011)Differential evolution is a very popular optimization algorithm and considerable research has been devoted to the development of efficient search operators. Motivated by the different manner in which various search operators ... -
Fair distributed congestion control in multirate multicast networks
(2005)We study fairness of resource allocation in multirate, multicast networks. In multirate networks, different receivers of the same multicast session can receive service at different rates. We develop a mathematical framework ... -
A framework for distributed bandwidth allocation in peer-to-peer networks
(2010)In peer-to-peer networks, each peer plays the role of client and server. As a server, it receives content requests of others and decides to what extent it will satisfy them by allocating upload bandwidth. As a client, it ... -
Frequency-based cache management policies for collaborative and non-collaborative topologies of segment based video caching proxies
(2006)This paper examines a novel cache management policy applied to non-collaborative and collaborative environments of more than one proxy server that serve homogeneous or even heterogeneous client requests for video streaming ... -
HECTOR: Enabling Microarray Experiments over the Hellenic Grid Infrastructure
(2009)Biologists, medical experts, biochemical engineers and researchers working on DNA microarray experiments are increasingly turning on Grid computing with the scope of leveraging the Grid's computing power, immense storage ... -
Joint optimal access point selection and channel assignment in wireless networks
(2007)In wireless cellular networks or in other networks with single-hop communication, the fundamental access control problem pertains to access point (AP) selection and channel allocation for each user. For users in the coverage ... -
Linear and Quadratic Complexity Bounds on the Values of the Positive Roots of Polynomials
(2009)In this paper we review the existing linear and quadratic complexity (upper) bounds on the values of the positive roots of polynomials and their impact on the performance of the Vincent-Akritas-Strzebonski (VAS) continued ... -
Minimal Evacuation Times and Stability
(2015)We consider a system where packets (jobs) arrive for processing using one of the policies in a given class. We study the connection between the minimal evacuation time and the stability region of the system and show that ... -
MNCM: A Critical Node Matching Approach to Scheduling for Input Buffered Switches With No Speedup
(2009)In this paper, we use fluid model techniques to establish new results for the throughput of input-buffered switches. Dai and Prabhakar have shown that any maximal size matching algorithm with speedup of 2 achieves 100% ... -
A new randomized data structure for the 11/2-dimensional range query problem
(2003)We propose RPST, a randomized data. structure for the 11/2-dimensional range query problem, based on a version of, Skip Lists, as an alternative to solutions that use. deterministic height balanced trees. Our scheme exhibits, ... -
Optimizing Client Association for Load Balancing and Fairness in Millimeter-Wave Wireless Networks
(2015)Millimeter-wave communications in the 60-GHz band are considered one of the key technologies for enabling multigigabit wireless access. However, the special characteristics of such a band pose major obstacles to the optimal ... -
Packet skipping and network coding for delay-sensitive network communication
(2012)We provide an analytical study of the impact of packet skipping and opportunistic network coding on the timely communication of messages through a single network element. In a first step, we consider a single-server queueing ...