Stem optimist$ (all stems)

51 papers:

SIGMOD-2015-BernsteinDDP #concurrent #database #optimisation

Optimizing Optimistic Concurrency Control for Tree-Structured, Log-Structured Databases (PAB, SD, BD, MP), pp. 1295–1309.

SIGMOD-2015-DudoladovXSKETM

Optimistic Recovery for Iterative Dataflows in Action (SD, CX, SS, AK, SE, KT, VM), pp. 1439–1443.

ICPC-2014-ThungLOC #classification #design #diagrams #metric #network #using

Condensing class diagrams by analyzing design and network metrics using optimistic classification (FT, DL, MHO, MRVC), pp. 110–121.

POPL-2014-BouajjaniEH #consistency #replication #verification

Verifying eventual consistency of optimistic replication systems (AB, CE, JH), pp. 285–296.

PPoPP-2014-HassanPR #transaction

Optimistic transactional boosting (AH, RP, BR), pp. 387–388.

ICML-c2-2013-ValkoCM #optimisation #probability

Stochastic Simultaneous Optimistic Optimization (MV, AC, RM), pp. 19–27.

ICML-c3-2013-ChenLZ #crowdsourcing #policy

Optimistic Knowledge Gradient Policy for Optimal Budget Allocation in Crowdsourcing (XC, QL, DZ), pp. 64–72.

SOSP-2013-ChidambaramPAA #consistency

Optimistic crash consistency (VC, TSP, ACAD, RHAD), pp. 228–243.

ICML-2012-Araya-LopezBT #using

Near-Optimal BRL using Optimistic Local Transitions (MAL, OB, VT), p. 70.

VLDB-2011-BernsteinRWY #concurrent

Optimistic Concurrency Control by Melding Trees (PAB, CWR, MW, XY), pp. 944–955.

SAC-2011-CherifIR #collaboration #data access #distributed #editing

Optimistic access control for distributed collaborative editors (AC, AI, MR), pp. 861–868.

IFM-2010-BouchenebIN #algorithm #model checking #replication

Symbolic Model-Checking of Optimistic Replication Algorithms (HB, AI, MN), pp. 89–104.

ICML-2009-SzitaL #learning #polynomial

Optimistic initialization and greediness lead to polynomial time learning in factored MDPs (IS, AL), pp. 1001–1008.

SAC-2009-MacielH #architecture #rest #transaction #using

An optimistic technique for transactions control using REST architectural style (LAHdSM, CMH), pp. 664–669.

ASPLOS-2008-KulkarniPRWBC #clustering #parallel

Optimistic parallelism benefits from data partitioning (MK, KP, GR, BW, KB, LPC), pp. 233–243.

PPoPP-2008-PraunBC #analysis #concurrent #dependence #modelling #using

Modeling optimistic concurrency using quantitative dependence analysis (CvP, RB, CC), pp. 185–196.

PLDI-2007-KulkarniPWRBC #abstraction #parallel

Optimistic parallelism requires abstractions (MK, KP, BW, GR, KB, LPC), pp. 211–222.

LCTES-2007-AhnLP #architecture

Optimistic coalescing for heterogeneous register architectures (MA, JL, YP), pp. 93–102.

PPoPP-2007-SchuffCP #detection #network #parallel

Conservative vs. optimistic parallelization of stateful network intrusion detection (DLS, YRC, VSP), pp. 138–139.

SAC-2006-RodriguesMC #order

From spontaneous total order to uniform total order: different degrees of optimistic delivery (LR, JM, NC), pp. 723–727.

ISMM-2006-Corry #java #stack

Optimistic stack allocation for java-like languages (EC), pp. 162–173.

VLDB-2005-ColohanASM #parallel #transaction

Optimistic Intra-Transaction Parallelism on Chip Multiprocessors (CBC, AA, JGS, TCM), pp. 73–84.

ICALP-2005-KursaweS

Optimistic Asynchronous Atomic Broadcast (KK, VS), pp. 204–215.

OOPSLA-2005-ShankarSBS #analysis #runtime

Runtime specialization with optimistic heap analysis (AS, SSS, RB, JES), pp. 327–343.

ECIR-2004-CachedaB #web

An Optimistic Model for Searching Web Directories (FC, RABY), pp. 364–377.

TACAS-2003-StollerC #reduction

Optimistic Synchronization-Based State-Space Reduction (SDS, EC), pp. 489–504.

ICFP-2003-EnnalsJ #adaptation #evaluation #source code #strict

Optimistic evaluation: an adaptive evaluation strategy for non-strict programs (RE, SLPJ), pp. 287–298.

ICALP-2001-Baum-Waidner #contract #multi

Optimistic Asynchronous Multi-party Contract Signing with Reduced Number of Rounds (BBW), pp. 898–911.

CIKM-2001-KimLJH #algorithm #hybrid #named #transaction

O-PreH: Optimistic Transaction Processing Algorithm based on Pre-Reordering in Hybrid Broadcast Environments (SK, SL, SYJ, CSH), pp. 553–555.

ICML-2001-Wyatt #learning #using

Exploration Control in Reinforcement Learning using Optimistic Model Selection (JLW), pp. 593–600.

ECOOP-2001-StromA

The Optimistic Readers Transformation (RES, JSA), pp. 275–301.

OOPSLA-2001-PechtchanskiS #analysis #framework #interprocedural

Dynamic Optimistic Interprocedural Analysis: A Framework and an Application (IP, VS), pp. 195–210.

DATE-2000-YooLJRCC #execution #performance

Fast Hardware-Software Coverification by Optimistic Execution of Real Processor (SY, JeL, JJ, KR, YC, KC), pp. 663–668.

ICALP-2000-Baum-WaidnerW #contract #multi

Round-Optimal and Abuse Free Optimistic Multi-party Contract Signing (BBW, MW), pp. 524–535.

LCTES-2000-JeongKL #concurrent #multi #realtime #using

Optimistic Secure Real-Time Concurrency Control Using Multiple Data Version (BSJ, DK, SL), pp. 33–47.

SIGMOD-1999-GehrkeGRL

BOAT-Optimistic Decision Tree Construction (JG, VG, RR, WYL), pp. 169–180.

DATE-1998-SchmerlerTM #logic #simulation

Advanced Optimistic Approaches in Logic Simulation (SS, YT, KDMG), pp. 362–368.

PPoPP-1997-Rinard #automation #effectiveness #source code #using

Effective Fine-Grain Synchronization for Automatically Parallelized Programs Using Optimistic Synchronization Primitives (MCR), pp. 112–123.

STOC-1996-AfekMO #algorithm #complexity #convergence

Convergence Complexity of Optimistic Rate Based Flow Control Algorithms (Extended Abstract) (YA, YM, ZO), pp. 89–98.

SIGMOD-1995-AdyaGLM #concurrent #performance #using

Efficient Optimistic Concurrency Control Using Loosely Synchronized Clocks (AA, RG, BL, UM), pp. 23–34.

HPDC-1995-CowanLB #performance #programming

Performance Benefits of Optimistic Programming: A Measure of HOPE (CC, HL, MAB), pp. 197–204.

PPoPP-1995-WallachHJKW #communication #scheduling

Optimistic Active Messages: A Mechanism for Scheduling Communication with Computation (DAW, WCH, KLJ, MFK, WEW), pp. 217–226.

SOSP-1995-PuABCCIKWZ #incremental #operating system

Optimistic Incremental Specialization: Streamlining a Commercial Operating System (CP, TA, APB, CC, CC, JI, LK, JW, KZ), pp. 314–324.

SIGMOD-1991-LevyKS #commit #distributed #protocol #transaction

An Optimistic Commit Protocol for Distributed Transaction Management (EL, HFK, AS), pp. 88–97.

VLDB-1991-HuangSRT #concurrent #evaluation #realtime

Experimental Evaluation of Real-Time Optimistic Concurrency Control Schemes (JH, JAS, KR, DFT), pp. 35–46.

PPoPP-1991-BaconS #communication #csp #parallel #process

Optimistic Parallelization of Communicating Sequential Processes (DFB, RES), pp. 155–166.

PODS-1990-HaritsaCL #constraints #on the #realtime

On Being Optimistic about Real-Time Constraints (JRH, MJC, ML), pp. 331–343.

SOSP-1985-MullenderT #concurrent #distributed

A Distributed File Service Based on Optimistic Concurrency Control (SJM, AST), pp. 51–62.

VLDB-1983-Reimer #concurrent #problem

Solving the Phantom Problem by Predicative Optimistic Concurrency Control (MR), pp. 81–88.

VLDB-1981-Schlageter #concurrent #database #distributed

Optimistic Methods for Concurrency Control in Distributed Database Systems (GS), pp. 125–130.

VLDB-1979-KungR #concurrent #on the

On Optimistic Methods for Concurrency Control (HTK, JTR), p. 351.