Search results for "2-OPT"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
166	Ramesh Gupta, Jayant R. Haritsa, Krithi Ramamritham	More optimism about real-time distributed commit processing.	RTSS	1997	DBLP DOI BibTeX RDF	real-time distributed commit processing, OPT, firm-deadline real-time database systems, data inaccessibility, missed transaction deadlines, sequential transactions, parallel distributed transactions, Shadow-OPT, healthy lenders heuristic, alternative priority, inheritance-based approach, performance, distributed databases, transaction processing, real-time performance, system configurations, commit protocol, priority inversion
128	Yee-Lin Lai, Kai Lung Hui	Internet opt-in and opt-out: investigating the roles of frames, defaults and privacy concerns.	CPR	2006	DBLP DOI BibTeX RDF	opt-in, opt-out, privacy concern, frames, information privacy, defaults
117	Chen-hsiung Chan, Sheng-An Lee, Cheng-Yan Kao, Huai-Kuang Tsai	Improving EAX with restricted 2-opt.	GECCO	2005	DBLP DOI BibTeX RDF	edge assembly crossover (EAX), restricted 2-opt, genetic algorithm, genetic algorithms, combinatorial optimization, local search, traveling salesman problem (TSP)
96	Tomohiro Yoshihara, Dai Kobayashi, Ryo Taguchi, Haruo Yokota	A Concurrency Control Method for Parallel Btree Structures.	ICDE Workshops	2006	DBLP DOI BibTeX RDF
93	Kengo Katayama, Akihiro Hamamoto, Hiroyuki Narihisa	Solving the maximum clique problem by k-opt local search.	SAC	2004	DBLP DOI BibTeX RDF	variable depth search, combinatorial optimization, local search, neighborhood, maximum clique problem
86	B. H. Shekar, D. S. Guru, P. Nagabhushan	Two-Dimensional Optimal Transform for Appearance Based Object Recognition.	ICVGIP	2006	DBLP DOI BibTeX RDF	Appearance Based Model, Face Recognition, Principal Component Analysis, Object Recognition, Optimal Transform
86	Ilya Baran, Erik D. Demaine	Optimal adaptive algorithms for finding the nearest and farthest point on a parametric black-box curve.	SCG	2004	DBLP DOI BibTeX RDF	adaptive algorithms, curves
83	Adam L. Buchsbaum, Howard J. Karloff, Claire Kenyon, Nick Reingold, Mikkel Thorup	OPT versus LOAD in dynamic storage allocation.	STOC	2003	DBLP DOI BibTeX RDF	approximation algorithms, polynomial time approximation schemes, dynamic storage allocation
80	Takafumi Matsuura, Tohru Ikeguchi	Chaotic Search for Traveling Salesman Problems by Using 2-opt and Or-opt Algorithms.	ICANN (2)	2008	DBLP DOI BibTeX RDF
75	Gruia Calinescu	Bounding the Payment of Approximate Truthful Mechanisms.	ISAAC	2004	DBLP DOI BibTeX RDF
75	Rabin A. Sugumar, Santosh G. Abraham	Efficient Simulation of Caches under Optimal Replacement with Applications to Miss Characterization.	SIGMETRICS	1993	DBLP DOI BibTeX RDF
72	Matthias Englert, Heiko Röglin, Berthold Vöcking	Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP: extended abstract.	SODA	2007	DBLP BibTeX RDF
72	Carolyn B. Seaman	Using the OPT improvement approach in the SQL/DS development environment.	CASCON	1994	DBLP BibTeX RDF
64	Alexander Clemm, Poon Leung	Model-driven open packet telephony management.	NOMS	2002	DBLP DOI BibTeX RDF
61	Nozomu Togawa, Masao Yanagisawa, Tatsuo Ohtsuki	Maple-opt: a performance-oriented simultaneous technology mapping, placement, and global routing algorithm for FPGAs.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1998	DBLP DOI BibTeX RDF
56	Vincenzo Cutello, Giuseppe Narzisi, Giuseppe Nicosia, Mario Pavone	Clonal Selection Algorithms: A Comparative Case Study Using Effective Mutation Potentials.	ICARIS	2005	DBLP DOI BibTeX RDF	CLONALG, opt-IA, one- counting, trap functions, 2D HP Protein Structure Prediction, pattern recognition, NP-complete problems, numerical optimization, Clonal Selection Algorithms
53	Vincenzo Cutello, Giuseppe Nicosia, Mario Pavone	Real coded clonal selection algorithm for unconstrained global optimization using a hybrid inversely proportional hypermutation operator.	SAC	2006	DBLP DOI BibTeX RDF	hypermutation operator, global optimization, artificial immune systems, immune algorithms, clonal selection algorithms, aging operator
53	Fouad B. Chedid	Optimal Parallel Block Access for Range Queries.	ICPADS	2004	DBLP DOI BibTeX RDF
53	Fernando Pedone, André Schiper	Optimistic Atomic Broadcast.	DISC	1998	DBLP DOI BibTeX RDF
50	Ioannis Mavroidis, Ioannis Papaefstathiou, Dionisios N. Pnevmatikatos	A Fast FPGA-Based 2-Opt Solver for Small-Scale Euclidean Traveling Salesman Problem.	FCCM	2007	DBLP DOI BibTeX RDF
50	Ioannis Mavroidis, Ioannis Papaefstathiou, Dionisios N. Pnevmatikatos	Hardware Implementation of 2-Opt Local Search Algorithm for the Traveling Salesman Problem.	IEEE International Workshop on Rapid System Prototyping	2007	DBLP DOI BibTeX RDF
50	Ju Wang, Jinmiao Li, Greg Butler	Implementing the PostgreSQL Query Optimizer within the OPT++ Framework.	APSEC	2003	DBLP DOI BibTeX RDF
50	Zhao Liu, Lishan Kang	A Hybrid Algorithm of n-OPT and GA to Solve Dynamic TSP.	GCC (2)	2003	DBLP DOI BibTeX RDF
46	Jingling Zhang, Yanwei Zhao, Dian-Jun Peng, Wanliang Wang	A Hybrid Quantum-Inspired Evolutionary Algorithm for Capacitated Vehicle Routing Problem.	ICIC (1)	2008	DBLP DOI BibTeX RDF	Quantum-Inspired Evolutionary Algorithm (QEA), 2-OPT, Hybrid Quantum-Inspired Evolutionary Algorithm (HQEA), Q-bit representation, Q-gate, capacitated vehicle routing problem
43	Maurice Cheung, Chaitanya Swamy	Approximation Algorithms for Single-minded Envy-free Profit-maximization Problems with Limited Supply.	FOCS	2008	DBLP DOI BibTeX RDF
43	Lap Chi Lau, Mohit Singh	Additive approximation for bounded degree survivable network design.	STOC	2008	DBLP DOI BibTeX RDF	approximation algorithms, steiner tree, bounded degree, iterative rounding, survivable network design
43	Raghav Kumar Gautam, N. Hemachandra 0001, Y. Narahari, V. Hastagiri Prakash	Optimal Auctions for Multi-Unit Procurement with Volume Discount Bids.	CEC/EEE	2007	DBLP DOI BibTeX RDF
43	Lijun Ji	Partition of Triples of Order 6k+5 into 6k+3 Optimal Packings and One Packing of Size 8k+4.	Graphs Comb.	2006	DBLP DOI BibTeX RDF	Partitionable candelabra system, t-wise balanced design, Packing
43	Ming Xiong, BiYu Liang, Kam-yiu Lam, Yang Guo	Quality of Service Guarantee for Temporal Consistency of Real-Time Transactions.	IEEE Trans. Knowl. Data Eng.	2006	DBLP DOI BibTeX RDF	probabilistic temporal consistency, quality of service, Real-time database, transactions scheduling
43	Ronald A. Iltis, Seung-Jun Kim, Duong A. Hoang	Noncooperative iterative MMSE beamforming algorithms for ad hoc networks.	IEEE Trans. Commun.	2006	DBLP DOI BibTeX RDF
43	Mahesh Kallahalla, Peter J. Varman	Optimal Read-Once Parallel Disk Scheduling.	Algorithmica	2005	DBLP DOI BibTeX RDF	Scheduling, Caching, Prefetching, Parallel I/O, External memory algorithms
43	Chandra Chekuri, Martin Pál	A Recursive Greedy Algorithm for Walks in Directed Graphs.	FOCS	2005	DBLP DOI BibTeX RDF
43	Vincenzo Cutello, Giuseppe Narzisi, Giuseppe Nicosia, Mario Pavone	An Immunological Algorithm for Global Numerical Optimization.	Artificial Evolution	2005	DBLP DOI BibTeX RDF
43	James B. Orlin, Dushyant Sharma	Extended neighborhood: Definition and characterization.	Math. Program.	2004	DBLP DOI BibTeX RDF
43	Kam-yiu Lam, Ming Xiong, BiYu Liang, Yang Guo	Statistical Quality of Service Guarantee for Temporal Consistency of Real-Time Data Objects.	RTSS	2004	DBLP DOI BibTeX RDF	probabilistic temporal consistency, Quality of Service (QoS), real-time database
43	Abraham P. Punnen, François Margot, Santosh N. Kabadi	TSP Heuristics: Domination Analysis and Complexity.	Algorithmica	2003	DBLP DOI BibTeX RDF
43	Raffaele Bruno 0001, Marco Conti, Enrico Gregori	Optimization of Efficiency and Energy Consumption in p-Persistent CSMA-Based Wireless LANs.	IEEE Trans. Mob. Comput.	2002	DBLP DOI BibTeX RDF	random access protocol, protocol capacity, performance analysis, Wireless LAN (WLAN), IEEE 802.11, energy consumption
43	Markus Nordén, Sverker Holmgren, Michael Thuné	OpenMP versus MPI for PDE Solvers Based on Regular Sparse Numerical Operators.	International Conference on Computational Science (3)	2002	DBLP DOI BibTeX RDF	UMA, Euler, Optimization, MPI, OpenMP, PDE, NUMA, Stencil
43	Xueyan Tang, Samuel T. Chanson	Optimal Hash Routing for Web Proxies.	ICDCS	2001	DBLP DOI BibTeX RDF
43	Edward S. Tam, Jude A. Rivers, Vijayalakshmi Srinivasan, Gary S. Tyson, Edward S. Davidson	Active Management of Data Caches by Exploiting Reuse Information.	IEEE Trans. Computers	1999	DBLP DOI BibTeX RDF	Multilateral cache, reuse information, active management
43	John L. Bruno, Edward G. Coffman Jr.	Optimal Fault-Tolerant Computing on Multiprocessor Systems.	Acta Informatica	1997	DBLP DOI BibTeX RDF
43	Ramesh Gupta, Jayant R. Haritsa, Krithi Ramamritham	Revisiting Commit Processing in Distributed Database Systems.	SIGMOD Conference	1997	DBLP DOI BibTeX RDF
40	Juan C. Meza, Ricardo A. Oliva, Patricia D. Hough, Pamela J. Williams	OPT++: An object-oriented toolkit for nonlinear optimization.	ACM Trans. Math. Softw.	2007	DBLP DOI BibTeX RDF	Object oriented programming, scientific computing, parallel optimization
40	Jon Timmis, Camilla Edmonds	A Comment on Opt-AiNET: An Immune Network Algorithm for Optimisation.	GECCO (1)	2004	DBLP DOI BibTeX RDF
40	Armin Wolf	Reduce-To-The-Opt - A Specialized Search Algorithm for Contiguous Task Scheduling.	CSCLP	2003	DBLP DOI BibTeX RDF
40	Mahesh Kallahalla, Peter J. Varman	PC-OPT: Optimal Offline Prefetching and Caching for Parallel I/O Systems.	IEEE Trans. Computers	2002	DBLP DOI BibTeX RDF	offline algorithm, scheduling, algorithms, caching, prefetching, online algorithm, buffer management, competitive ratio, Parallel I/O systems
40	Jean-Paul Watson, Charlie Ross, V. Eisele, J. Denton, José Bins, C. Guerra, L. Darrell Whitley, Adele E. Howe	The Traveling Salesrep Problem, Edge Assembly Crossover, and 2-opt.	PPSN	1998	DBLP DOI BibTeX RDF
37	Fatima Chahal, Hacène Fouchal, Dominique Gaïti	Consensus algorithms for Opt-in/Opt-out and proximity marketing context.	ICNC	2023	DBLP DOI BibTeX RDF
37	Joonas Merikko, Kwok Ng, Mohammed Saqr, Petri Ihantola	To Opt in or to Opt Out? Predicting Student Preference for Learning Analytics-Based Formative Feedback.	IEEE Access	2022	DBLP DOI BibTeX RDF
37	Duc Bui, Brian Tang, Kang G. Shin	Do Opt-Outs Really Opt Me Out?	CCS	2022	DBLP DOI BibTeX RDF
37	Wenbao Qiao, Jean-Charles Créput	Multiple k -opt evaluation multiple k -opt moves with GPU high performance local search to large-scale traveling salesman problems.	Ann. Math. Artif. Intell.	2020	DBLP DOI BibTeX RDF
37	Earvin Cabalquinto, Brett Hutchins	'"It should allow me to opt in or opt out": Investigating smartphone use and the contending attitudes of commuters towards geolocation data collection.	Telematics Informatics	2020	DBLP DOI BibTeX RDF
37	Wenbao Qiao, Jean-Charles Créput	Massive 2-opt and 3-opt Moves with High Performance GPU Local Search to Large-Scale Traveling Salesman Problem.	LION	2018	DBLP DOI BibTeX RDF
37	Marion Koelle, Swamy Ananthanarayan, Simon Czupalla, Wilko Heuten, Susanne Boll	Your smart glasses' camera bothers me!: exploring opt-in and opt-out gestures for privacy mediation.	NordiCHI	2018	DBLP DOI BibTeX RDF
37	Isabel Benavente Rodriguez, Nicolai Marquardt	Gesture Elicitation Study on How to Opt-in & Opt-out from Interactions with Public Displays.	ISS	2017	DBLP DOI BibTeX RDF
37	Paulus Swartz, Adéle da Veiga	PoPI Act - opt-in and opt-out compliance from a data value chain perspective: A South African insurance industry experiment.	ISSA	2016	DBLP DOI BibTeX RDF
37	Thomas Rothvoß	Approximating Bin Packing within O(log OPT * log log OPT) bins	CoRR	2013	DBLP BibTeX RDF
37	Thomas Rothvoß	Approximating Bin Packing within O(log OPT * Log Log OPT) Bins.	FOCS	2013	DBLP DOI BibTeX RDF
37	Kamil Rocki, Reiji Suda	Accelerating 2-opt and 3-opt Local Search Using GPU in the Travelling Salesman Problem.	CCGRID	2012	DBLP DOI BibTeX RDF
37	Kamil Rocki, Reiji Suda	Accelerating 2-opt and 3-opt local search using GPU in the travelling salesman problem.	HPCS	2012	DBLP DOI BibTeX RDF
37	Thomas Dreier	"Opt in" and "opt out" mechanisms in the internet era - towards a common theory.	Comput. Law Secur. Rev.	2010	DBLP DOI BibTeX RDF
37	Paul Voigt	Gesprächsaufzeichnung im Servicecallcenter - Opt-In oder Opt-Out? - Eine datenschutzrechtliche Betrachtung.	Datenschutz und Datensicherheit	2008	DBLP DOI BibTeX RDF
37	Jan Bouckaert, Hans Degryse	Opt In Versus Opt Out: A Free-Entry Analysis of Privacy Policies.	WEIS	2006	DBLP BibTeX RDF
37	Luc Muyldermans, Patrick Beullens, Dirk Cattrysse, Dirk Van Oudheusden	Exploring Variants of 2-Opt and 3-Opt for the General Routing Problem.	Oper. Res.	2005	DBLP DOI BibTeX RDF
37	Steven Bellman, Eric J. Johnson, Gerald L. Lohse	To Opt-In or Opt-Out? It Depends on the Question.	Commun. ACM	2001	DBLP DOI BibTeX RDF
37	Fred W. Glover	Finding a best traveling salesman 4-opt move in the same time as a best 2-opt move.	J. Heuristics	1996	DBLP DOI BibTeX RDF
35	Peter Brucker, Thomas Kampmeyer	Tabu Search Algorithms for Cyclic Machine Scheduling Problems.	J. Sched.	2005	DBLP DOI BibTeX RDF	job-shop problem, block approach, opt-connectivity, tabu-search, cyclic scheduling
35	Fabrício Olivetti de França, Fernando J. Von Zuben, Leandro Nunes de Castro	An artificial immune network for multimodal function optimization on dynamic environments.	GECCO	2005	DBLP DOI BibTeX RDF	opt-aiNet, dynamic optimization, multimodal optimization, immune network
35	Ben H. H. Juurlink	Approximating the optimal replacement algorithm.	Conf. Computing Frontiers	2004	DBLP DOI BibTeX RDF	OPT, virtual memory, paging, LRU, replacement strategy
34	Abdul Wadud, Anas Basalamah	Corrigendum to "Performance and challenges of Bi-directional resource allocation in multi-core space division multiplexing elastic optical networks" [Opt. Switch. Netw. 46 (2022) 100685].	Opt. Switch. Netw.	2023	DBLP DOI BibTeX RDF
32	Jiaquan Gao, Lei Fang	A Novel Artificial Immune System for Multiobjective Optimization Problems.	ISNN (3)	2009	DBLP DOI BibTeX RDF	Similar individuals, Evolutionary algorithm, Artificial immune system, Multiobjective optimization
32	Mingen Lin, Zhiyong Lin, Jinhui Xu 0001	Almost optimal solutions for bin coloring problems.	J. Comb. Optim.	2008	DBLP DOI BibTeX RDF	Approximation algorithms, Online algorithms, Bin packing
32	Tamás Király, Lap Chi Lau, Mohit Singh	Degree Bounded Matroids and Submodular Flows.	IPCO	2008	DBLP DOI BibTeX RDF
32	Alex Darrell, Heiko Meyer, Udo Birk, Kostas Marias, Michael Brady 0001, Jorge Ripoll	Maximum likelihood reconstruction for fluorescence Optical Projection Tomography.	BIBE	2008	DBLP DOI BibTeX RDF
32	Feng Zheng, John Nelson	Adaptive Design for the Packet Length of IEEE 802.11n Networks.	ICC	2008	DBLP DOI BibTeX RDF
32	Taewhan Kim, Jungeun Kim	Integration of Code Scheduling, Memory Allocation, and Array Binding for Memory-Access Optimization.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2007	DBLP DOI BibTeX RDF
32	Kaushik Rajan, Ramaswamy Govindarajan	Emulating Optimal Replacement with a Shepherd Cache.	MICRO	2007	DBLP DOI BibTeX RDF
32	Michael Butts, Anthony Mark Jones, Paul Wasson	A Structural Object Programming Model, Architecture, Chip and Tools for Reconfigurable Computing.	FCCM	2007	DBLP DOI BibTeX RDF
32	Ajay Deshpande, Taejung Kim, Erik D. Demaine, Sanjay E. Sarma	A Pseudopolynomial Time O (log n )-Approximation Algorithm for Art Gallery Problems.	WADS	2007	DBLP DOI BibTeX RDF
32	Mohit Singh, Lap Chi Lau	Approximating minimum bounded degree spanning trees to within one of optimal.	STOC	2007	DBLP DOI BibTeX RDF	approximation algorithm, spanning trees, bounded degree, iterative rounding
32	Zeev Nutov	Approximating Rooted Connectivity Augmentation Problems.	Algorithmica	2006	DBLP DOI BibTeX RDF	Rooted connectivity, Augmentation problems, Approximation algorithms, Hardness of approximation
32	Jaeheon Jeong, Michel Dubois 0001	Cache Replacement Algorithms with Nonuniform Miss Costs.	IEEE Trans. Computers	2006	DBLP DOI BibTeX RDF	Cache, power, latency, trace-driven simulations, memory system, replacement policy
32	Alexander Souza, Angelika Steger	The Expected Competitive Ratio for Weighted Completion Time Scheduling.	Theory Comput. Syst.	2006	DBLP DOI BibTeX RDF
32	Guilherme Palermo Coelho, Fernando J. Von Zuben	The Influence of the Pool of Candidates on the Performance of Selection and Combination Techniques in Ensembles.	IJCNN	2006	DBLP DOI BibTeX RDF
32	Mingen Lin, Zhiyong Lin, Jinhui Xu 0001	Almost Optimal Solutions for Bin Coloring Problems.	ISAAC	2005	DBLP DOI BibTeX RDF
32	Rob Sherwood, Bobby Bhattacharjee, Ryan Braud	Misbehaving TCP receivers can cause internet-wide congestion collapse.	CCS	2005	DBLP DOI BibTeX RDF	congestion control, distributed denial of service
32	Fouad B. Chedid	A Declustering Scheme With Guaranteed Worst-Case Additive Error O(k\frac{1}{{d - 1}}).	ICPADS (2)	2005	DBLP DOI BibTeX RDF
32	Andrzej Pelc, David Peleg	Feasibility and complexity of broadcasting with random transmission failures.	PODC	2005	DBLP DOI BibTeX RDF	omission faults, random failures, broadcasting, radio networks, Byzantine faults
32	Luke Demoracski, Dimiter R. Avresky	Performance analysis of fault-tolerant beacon vector routing for wireless sensor networks.	MSWiM	2005	DBLP DOI BibTeX RDF	BVR, wireless sensor networks, fault tolerance, routing, ad hoc networks, performance analysis
32	Uriel Feige, Mohammad Taghi Hajiaghayi, James R. Lee	Improved approximation algorithms for minimum-weight vertex separators.	STOC	2005	DBLP DOI BibTeX RDF	vertex separators, approximation algorithms, semidefinite programming, treewidth, metric embeddings
32	Jungeun Kim, Taewhan Kim	Memory access optimization through combined code scheduling, memory allocation, and array binding in embedded system design.	DAC	2005	DBLP DOI BibTeX RDF	scheduling, binding, memory access
32	Sariel Har-Peled, Kasturi R. Varadarajan	High-Dimensional Shape Fitting in Linear Time.	Discret. Comput. Geom.	2004	DBLP DOI BibTeX RDF
32	Julia Chuzhoy, Sudipto Guha, Sanjeev Khanna, Joseph Naor	Machine Minimization for Scheduling Jobs with Interval Constraints.	FOCS	2004	DBLP DOI BibTeX RDF
32	Evgeny I. Krengel	Almost-Perfect and Odd-Perfect Ternary Sequences.	SETA	2004	DBLP DOI BibTeX RDF
32	Sanjoy Dasgupta, Wee Sun Lee, Philip M. Long	A Theoretical Analysis of Query Selection for Collaborative Filtering.	Mach. Learn.	2003	DBLP DOI BibTeX RDF	approximation algorithms, recommender systems, collaborative filtering, inapproximability, membership queries
32	Tsan-sheng Hsu, Dian Rae Lopez	Executing Divisible Jobs on a Network with a Fixed Number of Processors.	COCOON	1998	DBLP DOI BibTeX RDF
29	Andreas Ibing, Holger Boche	Fair OFDMA Scheduling Algorithm Using Iterative Local Search with k-opt-Switches.	WCNC	2008	DBLP DOI BibTeX RDF
29	Xiaoming Gu, Tongxin Bai, Yaoqing Gao, Chengliang Zhang, Roch Archambault, Chen Ding 0001	P-OPT: Program-Directed Optimal Cache Management.	LCPC	2008	DBLP DOI BibTeX RDF
29	Kengo Katayama, Masashi Sadamatsu, Hiroyuki Narihisa	Iterated k-Opt Local Search for the Maximum Clique Problem.	EvoCOP	2007	DBLP DOI BibTeX RDF
29	Peitsang Wu, Kung-Jiuan Yang, Hsin-Chieh Fang	A Revised EM-Like Algorithm + K-OPT Method for Solving the Traveling Salesman Problem.	ICICIC (1)	2006	DBLP DOI BibTeX RDF