Stem reorder$ (all stems)

63 papers:

ICPC-2015-SabiMHK #code search #keyword #order

Reordering results of keyword-based code search for supporting simultaneous code changes (YS, HM, YH, SK), pp. 289–290.

ICALP-v1-2015-Avigdor-Elgrabli #on the #order #random

On the Randomized Competitive Ratio of Reordering Buffer Management with Non-Uniform Costs (NAE, SI, BM, YR), pp. 78–90.

ICALP-v1-2015-ImM #order

Weighted Reordering Buffer Improved via Variants of Knapsack Covering Inequalities (SI, BM), pp. 737–748.

FM-2015-0001K #bound #model checking #using

Property-Driven Fence Insertion Using Reorder Bounded Model Checking (SJ, DK), pp. 291–307.

PLDI-2014-StockKGPRRS #framework #order #reuse

A framework for enhancing data reuse via associative reordering (KS, MK, TG, LNP, FR, JR, PS), p. 10.

ICALP-v1-2014-EsfandiariHKLMR #online #order #probability #scheduling

Online Stochastic Reordering Buffer Scheduling (HE, MH, MRK, VL, HM, HR), pp. 465–476.

DATE-2013-ChiangTWHCDN #array #configuration management #on the #order #synthesis #using

On reconfigurable single-electron transistor arrays synthesis using reordering techniques (CEC, LFT, CYW, CYH, YCC, SD, VN), pp. 1807–1812.

CSMR-2013-SasakiHK #order #readability

Reordering Program Statements for Improving Readability (YS, YH, SK), pp. 361–364.

ICML-c3-2013-SunZ #evaluation #order #representation

Saving Evaluation Time for the Decision Function in Boosting: Representation and Reordering Base Learner (PS, JZ), pp. 933–941.

DAC-2011-Stergiou #diagrams #network #order #permutation

Implicit permutation enumeration networks and binary decision diagrams reordering (SS), pp. 615–620.

STOC-2011-AdamaszekCER #bound #order

Almost tight bounds for reordering buffer management (AA, AC, ME, HR), pp. 607–616.

SAC-2011-TianXLC #optimisation #order

Loop fusion and reordering for register file optimization on stream processors (WT, CJX, ML, EC), pp. 560–565.

ICALP-v1-2010-EpsteinLS #online #order

Max-min Online Allocations with a Reordering Buffer (LE, AL, RvS), pp. 336–347.

PADL-2010-AreiasR #implementation #linear #order #performance

An Efficient Implementation of Linear Tabling Based on Dynamic Reordering of Alternatives (MA, RR), pp. 279–293.

DATE-2009-KwonYUJ #performance #problem

In-network reorder buffer to improve overall NoC performance while resolving the in-order requirement problem (WCK, SY, JU, SWJ), pp. 1058–1063.

DATE-2009-WuM #logic #order #performance

Joint logic restructuring and pin reordering against NBTI-induced performance degradation (KCW, DM), pp. 75–80.

SIGMOD-2009-HanL #manycore #optimisation #order #query

Dependency-aware reordering for parallelizing query optimization in multi-core CPUs (WSH, JL), pp. 45–58.

CIKM-2009-LiuLW #order

Post-rank reordering: resolving preference misalignments between search engines and end users (CL, ML, YMW), pp. 641–650.

CIKM-2008-HsuC08a #matrix #order #performance #web

Efficient web matrix processing based on dual reordering (CMH, MSC), pp. 1389–1390.

CIKM-2008-LuoNEW #order #transaction

Transaction reordering with application to synchronized scans (GL, JFN, CJE, MW), pp. 1335–1336.

ECIR-2008-ShokouhiST #documentation #effectiveness #order

Investigating the Effectiveness of Clickthrough Data for Document Reordering (MS, FS, AT), pp. 591–595.

STOC-2007-EnglertRW #metric #order

Reordering buffers for general metric spaces (ME, HR, MW), pp. 556–564.

HPCA-2007-ShaoD #order #scheduling

A Burst Scheduling Access Reordering Mechanism (JS, BTD), pp. 285–294.

PPoPP-2007-Boehm #constraints #order #thread

Reordering constraints for pthread-style locks (HJB), pp. 173–182.

DAC-2006-NevoF #distributed #order

Distributed dynamic BDD reordering (ZN, MF), pp. 223–228.

ISMM-2006-HuangBGM #order #performance

Fast and efficient partial code reordering: taking advantage of dynamic recompilatior (XH, SMB, DG, KSM), pp. 184–192.

DAC-2005-JiangCC #3d #algorithm #linear #named #order

ICCAP: a linear time sparse transformation and reordering algorithm for 3D BEM capacitance extraction (RJ, YHC, CCPC), pp. 163–166.

SIGMOD-2005-BrantnerKM #order

Cost-Sensitive Reordering of Navigational Primitives (CCK, MB, GM), pp. 742–753.

ICALP-2005-EnglertW #cost analysis #modelling #order

Reordering Buffer Management for Non-uniform Cost Models (ME, MW), pp. 627–638.

HPCA-2005-JaleelJ #memory management #using

Using Virtual Load/Store Queues (VLSQs) to Reduce the Negative Effects of Reordered Memory Instructions (AJ, BLJ), pp. 191–200.

VLDB-2004-JohnsonKCKV #matrix #order #scalability #using

Compressing Large Boolean Matrices using Reordering Techniques (DSJ, SK, JC, SK, SV), pp. 13–23.

PLDI-2003-StroutCF #composition #runtime

Compile-time composition of run-time data and iteration reorderings (MMS, LC, JF), pp. 91–102.

CGO-2003-HaberKEMG #optimisation #order

Optimization Opportunities Created by Global Data Reordering (GH, MK, VE, BM, MG), pp. 228–240.

DATE-2002-Velev #similarity #using #verification

Using Rewriting Rules and Positive Equality to Formally Verify Wide-Issue Out-of-Order Microprocessors with a Reorder Buffer (MNV), pp. 28–35.

SAC-2002-WatanabeM #order

Reordering B-tree files (SW, TM), pp. 681–686.

DATE-2001-PomeranzR #order #sequence

Sequence reordering to improve the levels of compaction achievable by static compaction procedures (IP, SMR), pp. 214–218.

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.

SAC-2001-LeeYKP #algorithm #order #performance #towards

Processor reordering algorithms toward efficient GEN_BLOCK redistribution (SL, HGY, MSK, MSP), pp. 539–543.

ICLP-2001-GuoG #implementation #logic programming #order

A Simple Scheme for Implementing Tabled Logic Programming Systems Based on Dynamic Reordering of Alternatives (HFG, GG), pp. 181–196.

LCTES-2000-ChildersN #memory management #order #power management #transaction

Reordering Memory Bus Transactions for Reduced Power Consumption (BRC, TN), pp. 146–161.

DAC-1999-SantosJ #order #performance

A Reordering Technique for Efficient Code Motion (LCVdS, JAGJ), pp. 296–299.

DATE-1999-MeinelS #model checking #order #performance

Increasing Efficiency of Symbolic Model Checking by Accelerating Dynamic Variable Reordering (CM, CS), pp. 760–761.

DATE-1999-ThorntonWDD #diagrams #order #using

Variable Reordering for Shared Binary Decision Diagrams Using Output Probabilities (MAT, JPW, RD, ND), pp. 758–759.

VLDB-1999-RamanRH #interactive #online #order

Online Dynamic Reordering for Interactive Data Processing (VR, BR, JMH), pp. 709–720.

PLDI-1998-YangUW #branch #order #performance

Improving Performance by Branch Reordering (MY, GRU, DBW), pp. 130–141.

SIGIR-1998-CarbonellG #documentation #order #ranking #summary

The Use of MMR, Diversity-Based Reranking for Reordering Documents and Producing Summaries (JGC, JG), pp. 335–336.

HPCA-1998-KalamatianosK #order #performance

Temporal-Based Procedure Reordering for Improved Instruction Cache Performance (JK, DRK), pp. 244–253.

EDTC-1997-HettDB #order #performance #synthesis

Fast and efficient construction of BDDs by reordering based synthesis (AH, RD, BB), pp. 168–175.

CIKM-1997-LeeM #scheduling #transaction #validation

Commit-Reordering Validation Scheme for Transaction Scheduling in Client-Server Based Teleputing Systems: COREV (YL, SM), pp. 59–66.

DAC-1996-DasguptaK96a #order #reliability

Hot-Carrier Reliability Enhancement via Input Reordering and Transistor Sizing (AD, RK), pp. 819–824.

SIGMOD-1996-GoelI #optimisation #order #query #sql

SQL Query Optimization: Reordering for a General Class of Queries (PG, BRI), pp. 47–56.

VLDB-1996-SarawagiS #database #execution #memory management #order #query

Reordering Query Execution in Tertiary Memory Databases (SS, MS), pp. 156–167.

SIGMOD-1995-BhargavaGI #query

Hypergraph Based Reorderings of Outer Join Queries with Complex Predicates (GB, PG, BRI), pp. 304–315.

SAS-1995-RamachandranH

LSign Reordered (VR, PVH), pp. 330–347.

LOPSTR-1995-BossiCE #order #problem #source code

Transformation of Left Terminating Programs: the Reordering Problem (AB, NC, SE), pp. 33–45.

HPCA-1995-Lee #memory management #order

Memory Access Reordering in Vector Processors (DLL), pp. 380–389.

DAC-1993-CarlsonC #order #performance

Performance Enhancement of CMOS VLSI Circuits by Transistor Reordering (BSC, CYRC), pp. 361–366.

POPL-1993-MarriottS #constraints #logic programming #optimisation #order #refinement #source code

The 3 R’s of Optimizing Constraint Logic Programs: Refinement, Removal and Reordering (KM, PJS), pp. 334–344.

PLDI-1992-SarkarT #framework

A General Framework for Iteration-Reordering Loop Transformations (VS, RT), pp. 175–187.

DAC-1990-SinghC #layout #matrix #order

A Transistor Reordering Technique for Gate Matrix Layout (US, CYRC), pp. 462–467.

SIGMOD-1990-RosenthalG #graph #implementation #query

Query Graphs, Implementing Trees, and Freely-Reorderable Outerjoins (AR, CAGL), pp. 291–299.

PLDI-1990-Sarkar #order #parallel

Instruction Reordering for Fork-Join Parallelism (VS), pp. 322–336.

POPL-1984-Warren #order

A Hierarchical Basis for Reordering Transformations (JDW), pp. 272–282.