نتایج جستجو برای: time cost tradeoff

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

2006
Vittorio Cortellessa Fabrizio Marinelli Pasqualina Potena

Functional criteria often drive the component selection in the assembly of a software system. Minimal distance strategies are frequently adopted to select the components that require minimal adaptation effort. This type of approach hides to developers the non-functional characteristics of components, although they may play a crucial role to meet the system specifications. In this paper we intro...

2017
Ying-Dar Lin Chih-Chiang Wang Chien-Ying Huang Yuan-Cheng Lai

Network Function Virtualization (NFV) allows datacenters to consolidate network appliance functions onto commodity servers and devices. Currently telecommunication carriers are re-architecting their central offices as NFV datacenters that, along with Software-Defined Networking (SDN), help network service providers to speed deployment and reduce cost. However, it is still unclear how a carrier ...

Journal: :CoRR 2013
Mustafa Atay

HTML (Hyper Text Markup Language) has been the primary tool for designing and developing web pages over the years. Content and formatting information are placed together in an HTML document. XML (Extensible Markup Language) is a markup language for documents containing semi-structured and structured information. XML separates formatting from the content. While websites designed in HTML require ...

Journal: :CoRR 2017
Amit Chakrabarti Yining Chen

A single-player game of MEMORY is played with n distinct pairs of cards, with the cards in each pair bearing identical pictures. The cards are laid face-down. A move consists of revealing two cards, chosen adaptively. If these cards match, i.e., they bear the same picture, they are removed from play; otherwise, they are turned back to face down. The object of the game is to clear all cards whil...

2015
Michael Hoffmann John Iacono Patrick K. Nicholson Rajeev Raman

In nearest larger value (NLV) problems, we are given an array A[1..n] of numbers, and need to preprocess A to answer queries of the following form: given any index i ∈ [1, n], return a “nearest” index j such that A[j] > A[i]. We consider the variant where the values in A are distinct, and we wish to return an index j such that A[j] > A[i] and |j − i| is minimized, the nondirectional NLV (NNLV) ...

2013
Haelyeon Kim Yeonwoo Chung Sungju Lee Yongwha Chung Daihee Park

Generally, there is a tradeoff between quality and computational workload required to obtain that quality. In this paper, we focus on practical issues in implementing a pig activity monitoring system. We first propose a method for evaluating the quality-workload tradeoff in the activity monitoring application. Then, we derive the cost-effective solution within the acceptable range of quality fo...

2002
Yufei Tao Dimitris Papadias Jun Zhang

Aggregate window queries return summarized information about objects that fall inside a query rectangle (e.g., the number of objects instead of their concrete ids). Traditional approaches for processing such queries usually retrieve considerable extra information, thus compromising the processing cost. The paper addresses this problem for planar points from both theoretical and practical points...

Journal: :Mathematics of Computation 2021

Fermat’s well-known factorization algorithm is based on finding a representation of natural numbers $N$ as the difference squares. In 1895, Lawrence generalized this idea and applied it to multiples $kN$ original number. A systematic approach choose suitable values for $k$ was introduced by Lehman in 1974, which resulted first deterministic considerably faster than trial division. paper, we c...

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

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