Stem anneal$ (all stems)

53 papers:

SAT-2015-DouglassKR #quantum #satisfiability

Constructing SAT Filters with a Quantum Annealer (AD, ADK, JR), pp. 104–120.

CASE-2014-MaTLZLD #algorithm #hybrid #optimisation #scheduling

A hybrid particle swarm optimization and simulated annealing algorithm for job-shop scheduling (PCM, FT, YL, LZ, HXL, ZD), pp. 125–130.

DATE-2014-ZhaoL #bound

Empowering study of delay bound tightness with simulated annealing (XZ, ZL), pp. 1–6.

ICPR-2014-Filippone #classification #process #pseudo

Bayesian Inference for Gaussian Process Classifiers with Annealing and Pseudo-Marginal MCMC (MF), pp. 614–619.

ICML-c3-2013-OgawaITS

Infinitesimal Annealing for Training Semi-Supervised Support Vector Machines (KO, MI, IT, MS), pp. 897–905.

ICPR-2012-BianZSL #realtime

Parallelized Annealed Particle Filter for real-time marker-less motion tracking via heterogeneous computing (YB, XZ, JS, YL), pp. 2444–2447.

ICEIS-v2-2011-TarsauliyaTS #network #search-based #using

Financial Time Series Forecast using Simulated Annealing and Threshold Acceptance Genetic BPA Neural Network (AT, RT, AS), pp. 172–177.

SAC-2011-KostakisKMM #comparison #graph #using

Improved call graph comparison using simulated annealing (OK, JK, HM, KM), pp. 1516–1523.

ICPR-2010-UlkerGC #modelling #process

Annealed SMC Samplers for Dirichlet Process Mixture Models (YÜ, BG, ATC), pp. 2808–2811.

ICPR-2010-WangC #3d #estimation

3D Human Pose Estimation by an Annealed Two-Stage Inference Method (YKW, KYC), pp. 535–538.

SAC-2010-HoL #algorithm #constraints

Simulated annealing based algorithm for smooth robot path planning with different kinematic constraints (YJH, JSL), pp. 1277–1281.

DAC-2009-YeLCC #analysis #layout #process #variability

Variability analysis under layout pattern-dependent rapid-thermal annealing process (YY, FL, MC, YC), pp. 551–556.

ICEIS-J-2009-MohebiS #ambiguity #analysis #clustering #detection #hybrid #network #using

An Optimized Hybrid Kohonen Neural Network for Ambiguity Detection in Cluster Analysis Using Simulated Annealing (EM, MNMS), pp. 389–401.

KDD-2009-OzonatY #classification #multi #statistics #towards #web

Towards a universal marketplace over the web: statistical multi-label classification of service provider forms with simulated annealing (KMO, DY), pp. 1295–1304.

ICPR-2008-Lu #performance

Markerless human motion capture: An application of simulated annealing and Fast Marching Method (YL), pp. 1–4.

ICPR-2008-SahaB #clustering #multi #symmetry #using

A new multiobjective simulated annealing based clustering technique using stability and symmetry (SS, SB), pp. 1–4.

SAC-2008-MartinottoJCGDP #generative #network #random

Generation of continuous random networks by simulated annealing (ALM, FJ, LAC, VG, RVD, CAP), pp. 48–49.

CASE-2007-ChengOKKO #algorithm #problem #scheduling

Simulated Annealing Algorithm for Daily Nursing Care Scheduling Problem (MC, HIO, NK, KK, JO), pp. 507–512.

CASE-2007-YogeswaranPT #algorithm #heuristic #hybrid #problem #search-based #using

An hybrid heuristic using genetic algorithm and simulated annealing algorithm to solve machine loading problem in FMS (MY, SGP, MKT), pp. 182–187.

DATE-2006-MohantyVK #optimisation

Physical-aware simulated annealing optimization of gate leakage in nanoscale datapath circuits (SPM, RV, EK), pp. 1191–1196.

ICML-2006-SindhwaniKC #kernel

Deterministic annealing for semi-supervised kernel machines (VS, SSK, OC), pp. 841–848.

ICPR-v2-2006-CourteilleDM #problem #using

A Global Solution to the SFS Problem Using B-spline Surface and Simulated Annealing (FC, JDD, GM), pp. 332–335.

DAC-2005-EguroHS #adaptation #architecture

Architecture-adaptive range limit windowing for simulated annealing FPGA placement (KE, SH, AS), pp. 439–444.

ICALP-2005-Wegener #combinator #optimisation

Simulated Annealing Beats Metropolis in Combinatorial Optimization (IW), pp. 589–601.

MLDM-2005-GhoshGYB #algorithm #analysis #comparative #network #search-based

Comparative Analysis of Genetic Algorithm, Simulated Annealing and Cutting Angle Method for Artificial Neural Networks (RG, MG, JY, AMB), pp. 62–70.

OOPSLA-2005-Vanderburg #agile #process #programming

A simple model of agile software processes — or — extreme programming annealed (GV), pp. 539–545.

ICPR-v2-2004-LiuLW #using

Free Form Shape Matching Using Deterministic Annealing and Softassign (YL, LL, YW), pp. 128–131.

DATE-2003-ChoiB #migration #network #using

Hierarchical Global Floorplacement Using Simulated Annealing and Network Flow Area Migration (WC, KB), pp. 11104–11105.

SAC-2002-LiL #problem

Local search with annealing-like restarts to solve the vehicle routing problem with time windows (HL, AL), pp. 560–565.

ICPR-v3-2000-ChoPP #image #segmentation #using

Segmentation of Color Image Using Deterministic Annealing EM (WHC, SYP, JP), pp. 3646–3649.

ICEIS-1999-MelicioCR #problem

Solving the Timetabling Problem with Simulated Annealing (FM, JPC, ACR), pp. 272–279.

ICPR-1998-GoktepeAYY #image #markov #modelling #random #segmentation #using

Unsupervised texture based image segmentation by simulated annealing using Markov random field and Potts models (MG, VA, NY, CY), pp. 820–822.

ISSTA-1998-TraceyCM #automation #using

Automated Program Flaw Finding Using Simulated Annealing (NT, JAC, KM), pp. 73–81.

ICDAR-1997-HiranoOY #recognition #using

Structural Character Recognition Using Simulated Annealing (TH, YO, FY), pp. 507–510.

SAC-1997-CornoPRR #algorithm #generative #named

SAARA: a simulated annealing algorithm for test pattern generation for digital circuits (FC, PP, MR, MSR), pp. 228–232.

ICPR-1996-FinchWH #relational

Relational matching with mean field annealing (AMF, RCW, ERH), pp. 359–363.

ICPR-1996-HuangLSSSLTH #approach #classification #nearest neighbour #prototype

A simulated annealing approach to construct optimized prototypes for nearest-neighbor classification (YSH, KL, CYS, AJS, IIS, MCL, RYT, PKH), pp. 483–487.

KDD-1996-HofmannB #clustering

Inferring Hierarchical Clustering Structures by Deterministic Annealing (TH, JMB), pp. 363–366.

PODS-1994-HuaLL #clustering

A Decomposition-Based Simulated Annealing Technique for Data Clustering (KAH, SDL, WKL), pp. 117–128.

SAC-1994-RosenG #network #using

Training hard to learn networks using advanced simulated annealing methods (BER, JMG), pp. 256–260.

SAC-1994-Sen94a #network #using

File placement over a network using simulated annealing326741 (SS), pp. 251–255.

ICDAR-1993-LeeS #design #modelling #using

Optimal design of reference models using simulated annealing combined with an improved LVQ3 (SWL, HHS), pp. 244–249.

DAC-1990-ChatterjeeH #approach #clustering

A New Simultaneous Circuit Partitioning and Chip Placement Approach Based on Simulated Annealing (AC, RIH), pp. 36–39.

DAC-1989-BuiHJL #algorithm #graph #performance

Improving the Performance of the Kernighan-Lin and Simulated Annealing Graph Bisection Algorithms (TNB, CH, CJ, FTL), pp. 775–778.

DAC-1988-LamD #performance

Performance of a New Annealing Schedule (JL, JMD), pp. 306–311.

DAC-1988-MallelaG #clustering #standard

Clustering Based Simulated Annealing for Standard Cell Placement (SM, LKG), pp. 312–317.

DAC-1988-Sechen #metaprogramming #using

Chip-Planning, Placement, and Global Routing of Macro/Custom Cell Integrated Circuits Using Simulated Annealing (CS), pp. 73–80.

ICALP-1988-RajasekaranR

Nested Annealing: A Provable Improvement to Simulated Annealing (SR, JHR), pp. 455–472.

SIGMOD-1987-Ioannidis #optimisation #query

Query Optimization by Simulated Annealing (YEI, EW), pp. 9–22.

DAC-1986-KravitzR #multi

Multiprocessor-based placement by simulated annealing (SAK, RAR), pp. 567–573.

DAC-1986-NaharSS #combinator #optimisation

Simulated annealing and combinatorial optimization (SN, SS, ES), pp. 293–299.

DAC-1986-PincusD #reduction #using

Delay reduction using simulated annealing (JDP, AMD), pp. 690–695.

DAC-1985-NaharSS

Experiments with simulated annealing (SN, SS, ES), pp. 748–752.