25 papers:
- KDD-2015-BegumUWK #clustering #novel
- Accelerating Dynamic Time Warping Clustering with a Novel Admissible Pruning Strategy (NB, LU, JW, EJK), pp. 49–58.
- CASE-2014-JinNHXC #policy
- Threshold-type admission policy for remanufacturing systems (XJ, JN, SJH, GX, QC), pp. 467–473.
- CASE-2014-LuXJ #markov #process
- A Markov Decision Process model for elective inpatient admission with delay announcement (YL, XX, ZJ), pp. 552–557.
- SIGIR-2014-MaLWSBWW #named #policy #query #web
- PAAP: prefetch-aware admission policies for query results cache in web search engines (HM, WL, BW, LS, XB, LW, BW), pp. 983–986.
- LICS-CSL-2014-BrenguierRS #complexity #game studies
- The complexity of admissibility in ω-regular games (RB, JFR, MS), p. 10.
- RTA-TLCA-2014-Burel
- Cut Admissibility by Saturation (GB), pp. 124–138.
- IDGD-2011-LeeY #education #web
- Does Internationalization Have Its Own Face in Each Country? Measuring the Internationalization of Web Presence on Higher Education Admission Web Pages between USA and Taiwan (JL, MY), pp. 524–532.
- CASE-2010-MazierXS #scheduling
- Scheduling inpatient admission under high demand of emergency patients (AM, XX, MS), pp. 792–797.
- DATE-2010-MasrurCF
- Constant-time admission control for Deadline Monotonic tasks (AM, SC, GF), pp. 220–225.
- CSEET-2009-ThompsonE09a #how #question #student
- How Can We Scale-Up Student Admissions and Graduate Completions? (JBT, HME), pp. 298–299.
- HIMI-MTT-2007-PakKH #adaptation #multi
- An Adaptive Frame-Based Admission Control for Multimedia Traffic in Wireless LAN (JP, YK, KH), pp. 720–727.
- SAC-2004-KarabudakHB #algorithm #search-based #using
- A call admission control scheme using genetic algorithms (DK, CCH, BB), pp. 1151–1158.
- ICALP-2003-AwerbuchBS
- Anycasting in Adversarial Systems: Routing and Admission Control (BA, AB, CS), pp. 1153–1168.
- CSL-2003-Iemhoff #proving #towards
- Towards a Proof System for Admissibility (RI), pp. 255–270.
- DAC-2002-LinC #named #orthogonal
- TCG-S: orthogonal coupling of P*-admissible representations for general floorplans (JML, YWC), pp. 842–847.
- KR-2000-DimopoulosNT
- Finding Admissible and Preferred Arguments Can be Very Hard (YD, BN, FT), pp. 53–61.
- SAC-2000-KangY #realtime #statistics
- Statistical Admission Control for Real-Time VOD Servers (SK, HYY), pp. 579–584.
- PODS-1998-GarofalakisIOS #database
- Throughput-Competitive Admission Control for Continuous Media Databases (MNG, YEI, BÖ, AS), pp. 79–88.
- CADE-1998-Crary #fixpoint #induction
- Admissibility of Fixpoint Induction over Partial Types (KC), pp. 270–285.
- JICSLP-1998-EchahedJ #graph grammar
- Admissible Graph Rewriting and Narrowing (RE, JCJ), pp. 325–342.
- SAC-1996-ChenH #algorithm #multi #realtime
- Threshold-based dynamic admission control algorithms for real-time multimedia servers (IRC, THH), pp. 224–229.
- ICALP-1993-BaligaC #named
- Learnability: Admissible, Co-finite, and Hypersimple Languages (GB, JC), pp. 289–300.
- ML-1989-MostowP #heuristic #optimisation
- Discovering Admissible Search Heuristics by Abstracting and Optimizing (JM, AP), p. 240.
- STOC-1978-ScioreT
- Computability Theory in Admissible Domains (ES, AT), pp. 95–104.
- ICALP-1978-ScioreT
- Admissible Coherent CPO’s (ES, AT), pp. 440–456.