22 papers:
CASE-2015-KobayashiH #realtime- Optimal real-time pricing of electricity with consideration for decrease in price effect (KK, KH), pp. 539–544.
HIMI-IKD-2015-HilanoY- Increase and Decrease of Optical Illusion Strength By Vibration (TH, KY), pp. 366–373.
ICALP-v1-2014-IaconoO #why- Why Some Heaps Support Constant-Amortized-Time Decrease-Key Operations, and Others Do Not (JI, ÖÖ), pp. 637–649.
RTA-TLCA-2014-AotoTU #confluence #diagrams #proving #term rewriting- Proving Confluence of Term Rewriting Systems via Persistency and Decreasing Diagrams (TA, YT, KU), pp. 46–60.
ISMM-2013-ReamesN #garbage collection #towards- Towards hinted collection: annotations for decreasing garbage collector pause times (PR, GCN), pp. 3–14.
CAV-2013-ClaessenFIPW #model checking #network #reachability #set- Model-Checking Signal Transduction Networks through Decreasing Reachability Sets (KC, JF, SI, NP, QW), pp. 85–100.
RTA-2013-FelgenhauerO #diagrams #order #proving- Proof Orders for Decreasing Diagrams (BF, VvO), pp. 174–189.
RTA-2013-Zankl #confluence #diagrams- Confluence by Decreasing Diagrams — Formalized (HZ), pp. 352–367.
SAS-2012-HalbwachsH #sequence- When the Decreasing Sequence Fails (NH, JH), pp. 198–213.
SEKE-2011-SantosSN #functional #order #performance #reuse #testing- Reusing Functional Testing in order to Decrease Performance and Stress Testing Costs (IdSS, ARS, PdAdSN), pp. 470–474.
RTA-2011-ZanklFM #diagrams- Labelings for Decreasing Diagrams (HZ, BF, AM), pp. 377–392.
SAT-2011-CreignouOS #csp- Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight (NC, FO, JS), pp. 120–133.
IJCAR-2010-HirokawaM #diagrams #termination- Decreasing Diagrams and Relative Termination (NH, AM), pp. 487–501.
RTA-2010-Aoto #automation #confluence #diagrams #proving- Automated Confluence Proof by Decreasing Diagrams based on Rule-Labelling (TA), pp. 7–16.
RTA-2008-Oostrom #confluence #diagrams- Confluence by Decreasing Diagrams (VvO), pp. 306–320.
ICML-2007-Werner #algorithm #consistency #question #what- What is decreased by the max-sum arc consistency algorithm? (TW), pp. 1007–1014.
STOC-2003-Thorup #constant #integer #problem- Integer priority queues with decrease key in constant time and the single source shortest paths problem (MT), pp. 149–158.
ICDAR-2001-AyatCRS #image #kernel #named #pattern matching #pattern recognition #recognition- KMOD — A New Support Vector Machine Kernel with Moderate Decreasing for Pattern Recognition. Application to Digit Image Recognition (NEA, MC, LR, CYS), p. 1215–?.
ICALP-1998-Grolmusz- A Degree-Decreasing Lemma for (MOD q — MOD p) Circuits (VG), pp. 215–222.
PLDI-1995-LiaoDKTW- Storage Assignment to Decrease Code Size (SYL, SD, KK, SWKT, AW), pp. 186–195.
ML-1991-ChienGD #learning #on the- On Becoming Decreasingly Reactive: Learning to Deliberate Minimally (SAC, MTG, GD), pp. 288–292.
DAC-1990-Fishburn #heuristic #how #logic- A Depth-Decreasing Heuristic for Combinational Logic: Or How To Convert a Ripple-Carry Adder Into A Carry-Lookahead Adder Or Anything in-between (JPF), pp. 361–364.