نتایج جستجو برای: vcg

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

Journal: :IJAACS 2008
Yu Wang Teresa A. Dahlberg Weizhao Wang

Wireless mesh networks (WMNs) consist of mesh routers and mesh clients where fixed mesh routers form the multi-hop backbone of the network. It is often assumed that each individual mesh client will faithfully follow the prescribed protocols. However, these mobile devices, owned by individual users, will likely do what is the most beneficial to their owners, i.e. act ‘selfishly’. In this article...

2015
Caroline J. M. van Deursen Liliane Wecke Wouter M. van Everdingen Marcus Ståhlberg Michel H. G. Janssen Frieder Braunschweig Lennart Bergfeldt Harry J. G. M. Crijns Kevin Vernooy Frits W. Prinzen

Current optimization of atrioventricular (AV) and interventricular (VV) intervals in cardiac resynchronization therapy (CRT) is time consuming and subject to noise. We aimed to prove the principle that the best hemodynamic effect of CRT is achieved by cancelation of opposing electrical forces, detectable from the QRS morphology in the 3D vectorcardiogram (VCG). Different degrees of left (LV) an...

2012
Michal Feldman Reshef Meir Moshe Tennenholtz

We introduce a measure for the level of stability against coalitional deviations, called stability scores, which generalizes widely used notions of stability in non-cooperative games. We use the proposed measure to compare various Nash equilibria in congestion games, and to quantify the effect of game parameters on coalitional stability. For our main results, we apply stability scores to analyz...

Journal: :Electr. Notes Theor. Comput. Sci. 2009
Magnus O. Myreen Michael J. C. Gordon

This paper presents a new proof-assistant based approach to program verification: programs are translated, via fully-automatic deduction, into tail-recursive function defined in the logic of a theorem prover. This approach improves on well-established methods based on Hoare logic and verification condition generation (VCG) by removing the need to annotate programs with assertions, making the pr...

Journal: :Food additives & contaminants. Part A, Chemistry, analysis, control, exposure & risk assessment 2010
M Donner J Atehnkeng R A Sikora R Bandyopadhyay P J Cotty

Aflatoxins are highly toxic carcinogens produced by several species in Aspergillus section Flavi. Strains of A. flavus that do not produce aflatoxins, called atoxigenic strains, have been used commercially in North America as tools for limiting aflatoxin contamination. A similar aflatoxin management strategy is being pursued in Nigeria. In the current study, loci across the 68 kb aflatoxin bios...

2007
Makoto Yokoo Atsushi Iwasaki

The Vickrey-Clarke-Groves (VCG) protocol is a theoretically well-founded protocol that can be used for combinatorial auctions. However, the VCG has several limitations such as (a) vulnerability to false-name bids, (b) vulnerability to loser collusion, and (c) the outcome is not in the core. Yokoo, Matsutani, & Iwasaki (2006) presented a new combinatorial auction protocol called the Groves Mecha...

Journal: :Circulation 1979
E Piccolo A Raviele P Delise F Dainese P Pascotto G Totaro F Sartori D D'Este

Various electrocardiographic and vectorcardiographic (ECG-VCG) patterns of ventricular conduction disturbances are inducible by premature right atrial stimulation (PRAS). These patterns are a consequence of different degrees of refractoriness in the specialized ventricular conduction system. We observed that the intermediate phase of left bundle branch block (LBBB) induced by PRAS in 20 subject...

2008
Gunes Ercal Rafit Izhak-Ratzin Rupak Majumdar Adam Meyerson

We study game-theoretic mechanisms for routing in ad-hoc networks. Game-theoretic mechanisms capture the non-cooperative and selfish behavior of nodes in a resource-constrained environment. There have been some recent proposals to use incentive-based mechanisms (in particular, VCG) for routing in wireless ad-hoc networks, and some frugality bounds are known when the connectivity graph is essent...

2006
John Matthews J. Strother Moore Sandip Ray Daron Vroon

We present a method to convert (i) an operational semantics for a given machine language, and (ii) an off-the-shelf theorem prover, into a high assurance verification condition generator (VCG). Given a program annotated with assertions at cutpoints, we show how to use the theorem prover directly on the operational semantics to generate verification conditions analogous to those produced by a cu...

2010
Qiang Zhang Minming Li

We consider the task of designing a truthful auction mechanism for CPU time scheduling problem. There are m commodities (time slots) T = {t1, t2, . . . , tm} for n buyers I = {1, 2, . . . , n}. Each buyer requires a number of time slots si for its task. The valuation function of buyer i for a bundle of time slots Ti is vi(Ti) = wi(m− t), where t is the last time slot in Ti and |Ti| = si. The ut...

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

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