نتایج جستجو برای: algo rithm

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

1999
Athena Vakali

Caching is a standard solution to the problem of insuf cient bandwidth caused by the rapid increase of in formation circulation across the Internet Cache con sistency mechanisms are a crucial component of each cache scheme in uencing the cache usefulness and re liability This paper presents a model for optimizing Internet cache content by the use of a genetic algo rithm and examines the model b...

2012
A. M. Hassan M. R. Hajihashemi M. El-Shenawee

Bacteria exist in a variety of groups of shapes, sizes, and single or multiple cell formations. In this paper, the level set shape reconstruction technique, the method of moments, and the marching cubes methods are integrated in the high frequency band for imaging three dimensional bacteria. The time step and the resolution of the marching cubes method are investigated to smooth the error funct...

2011
S. Roy S. Minhazul Islam S. Ghosh S. Das A. Abraham

In recent years, Wireless Sensor Networks (WSNs) have transitioned from being objects of academic research interest to a technology that is frequently being employed in real-life applications and rapidly being commercialized. The performance of a WSN is largely affected by high quality deployment and precise localization of sensor nodes. This article deliberates autonomous deployment of sensor ...

2009
J. P. Sun S. Y. Mao G. H. Wang

This paper presents an Extended Exact Transfer Function (EETF) algorithm for Bistatic Synthetic Aperture Radar (BiSAR) imaging of a Translational Invariant (TI) case. This algorithm adopts directly the 2D transfer function of monostatic SAR (MoSAR), instead of deriving a new one, by converting the BiSAR into an equivalent MoSAR. A new azimuth phase compensation function is constructed through e...

2014
LIANG DAI Liang Dai

This thesis studies several problems related to recovery and estimation. Specifically, these problems are about sparsity and low-rankness, and the randomized Kaczmarz algorithm. This thesis includes four papers referred to as Paper I, Paper II, Paper III, and Paper IV. Paper I considers how to make use of the fact that the solution to an overdetermined system is sparse. This paper presents a th...

2002
Tatsuya YOSHIDA Shirmila MOHOTTALA Masataka KAGESAWA Katsushi IKEUCHI

This paper describes our vehicle classification system, which is based on local-feature configuration. We have already demonstrated that our system works very well for vehicle recognition in outdoor environments. The algorithm is based on our previous work, which is a generalization of the eigen-window method. This method has the following three advantages: (1) It can detect even if parts of th...

2013
J. Arunnehru Kalaiselvi Geetha

Three major object tracking algorithms are evaluated in this paper. The performances of these algorithms for different video sequences are analysed. Object tracking is an important task in many surveillance applications, some problem and its difficulty depend on several factors such as pose change, various lighting condition, occlusion, dynamic object, scale and object motion, recent tracking a...

2015
Chen-Yang Zhao Ling Wang Jie Qin Wen-Qiang Zhang

Growing numbers of web services that offer identical functionality but differ in non-functional properties are emerging on the network, to the need to select them to form a composite service to meet user’s requirements has become one research hotspot. Web service selection methods are an attempt to to find optimal solutions for users. However, because each user’s personal preference is differen...

2011
Arnon Netzer Amnon Meisels

Distributed Social Constraints Optimization Problems (DSCOPs) are DCOPs in which the global objective function for optimization incorporates a social welfare function (SWF). DSCOPs have individual, non-binary and asym-metric constraints and thus form a unique DCOP class. DSCOPs provide a natural framework for agents that compute their costs individually and are therefore self-interested. The co...

Journal: :J. Algorithms 1990
David B. Johnson Willy Zwaenepoel

In a distributed system using message logging and checkpointing to provide fault tolerance there is always a unique maximum recoverable system state regardless of the message logging protocol used The proof of this relies on the observation that the set of system states that have occurred during any single execution of a system forms a lattice with the sets of consistent and recoverable system ...

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

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