Search results for "Bound"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
23	E. Betti, Massimiliano Sala	A New Bound for the Minimum Distance of a Cyclic Code From Its Defining Set.	IEEE Trans. Inf. Theory	2006	DBLP DOI BibTeX RDF
23	Kenneth E. Hild II, Deniz Erdogmus, José Carlos Príncipe	Experimental upper bound for the performance of convolutive source separation methods.	IEEE Trans. Signal Process.	2006	DBLP DOI BibTeX RDF
23	Jinjun Chen, Yun Yang 0001	Dynamic Setting, Verification and Adjustment of Upper Bound Constraints in Grid Workflow Systems.	SKG	2006	DBLP DOI BibTeX RDF
23	Paul Horton, Wataru Fujibuchi	An Upper Bound on the Hardness of Exact Matrix Based Motif Discovery.	CPM	2005	DBLP DOI BibTeX RDF
23	Peter Auer, Ronald Ortner	A New PAC Bound for Intersection-Closed Concept Classes.	COLT	2004	DBLP DOI BibTeX RDF
23	Rahul Jain 0001, Jaikumar Radhakrishnan, Pranab Sen	A Lower Bound for the Bounded Round Quantum Communication Complexity of Set Disjointness.	FOCS	2003	DBLP DOI BibTeX RDF
23	Hachemi Bennaceur, Aomar Osmani	Computing Lower Bound for MAX-CSP Problems.	IEA/AIE	2003	DBLP DOI BibTeX RDF
23	Károly Bezdek	Improving Rogers' Upper Bound for the Density of Unit Ball Packings via Estimating the Surface Area of Voronoi Cells from Below in Euclidean d-Space for All d>=8.	Discret. Comput. Geom.	2002	DBLP DOI BibTeX RDF
23	Tarek F. Abdelzaher, Björn Andersson, Jan Jonsson, Vivek Sharma 0004, Minh Nguyen	The Aperiodic Multiprocessor Utilization Bound for Liquid Tasks.	IEEE Real Time Technology and Applications Symposium	2002	DBLP DOI BibTeX RDF	Real-time scheduling, schedulability analysis, utilization bounds, aperiodic tasks
23	Harry Dwyer, John Fernando	Establishing a tight bound on task interference in embedded system instruction caches.	CASES	2001	DBLP DOI BibTeX RDF
23	Mayez A. Al-Mouhamed	Lower Bound on the Number of Processors and Time for Scheduling Precedence Graphs with Communication Costs.	IEEE Trans. Software Eng.	1990	DBLP DOI BibTeX RDF	precedence graphs, earliest starting time, task delay, finish time, minimum time increase, interprocessor communication links, optimum performance, small graphs, scheduling, scheduling, graph theory, lower bounds, communication costs, task graph, completion time, time interval
23	Katalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven	On the Black-Box Complexity of Sperner's Lemma.	Theory Comput. Syst.	2009	DBLP DOI BibTeX RDF	Sperner’s lemma, Probabilistic and quantum lower bound, Deterministic algorithm, Query complexity
23	Adam Panagos, Kurt L. Kosbar	A new design metric for unitary space-time codes.	IWCMC	2006	DBLP DOI BibTeX RDF	union bound design metric, unitary space-time code, MIMO
23	Myungsook Klassen, Russell Stockard, Ali Akbari	Stimulating information technology education among underrepresented minorities.	SIGITE Conference	2004	DBLP DOI BibTeX RDF	computer science college major, computer science pipeline, status attainment model, underrepresented minorities, upward bound program, information technology, self-efficacy, social cognition theory
23	Satoshi Fujita, Tadanori Nakagawa	Lower Bounding Techniques for the Multiprocessor Scheduling Problem with Communication Delay.	IEEE PACT	1999	DBLP DOI BibTeX RDF	inevitable communication delay, lower bound, Multiprocessor scheduling problem
23	Chuan-Yu Wang, Kaushik Roy 0001	Maximum power estimation for CMOS circuits using deterministic and statistic approaches.	VLSI Design	1996	DBLP DOI BibTeX RDF	maximum power estimation, deterministic approach, instantaneous power consumption, ATG technique, Monte Carlo based technique, computational complexity, VLSI, lower bound, statistical analysis, automatic testing, circuit analysis computing, Monte Carlo methods, automatic test generation, VLSI circuits, CMOS circuits, CMOS digital integrated circuits, statistic approach
22	Christoph Burnikel, Stefan Funke, Kurt Mehlhorn, Stefan Schirra, Susanne Schmitt	A Separation Bound for Real Algebraic Expressions.	Algorithmica	2009	DBLP DOI BibTeX RDF	Separation bound, Zero testing, Exact geometric computation
22	Gio K. Kao, Edward C. Sewell, Sheldon H. Jacobson	A branch, bound, and remember algorithm for the 1\| r i \| Sigma t i scheduling problem.	J. Sched.	2009	DBLP DOI BibTeX RDF	Scheduling theory and algorithms, Dynamic programming, Branch and bound algorithms
22	Justin Yip, Pascal Van Hentenryck	Length-lex bound consistency for knapsack constraints.	SAC	2009	DBLP DOI BibTeX RDF	length-lex, set variable, knapsack, bound consistency
22	Christian Artigues, Dominique Feillet	A branch and bound method for the job-shop problem with sequence-dependent setup times.	Ann. Oper. Res.	2008	DBLP DOI BibTeX RDF	Dynamic programming, Branch and bound, Constraint propagation, Job-shop scheduling, Sequence-dependent setup times
22	UmaMaheswari C. Devi, James H. Anderson	A schedulable utilization bound for the multiprocessor EPDF\mathsf{EPDF} Pfair algorithm.	Real Time Syst.	2008	DBLP DOI BibTeX RDF	Multiprocessors, Real-time scheduling, Utilization bound, Pfair
22	Samuel Burer, Dieter Vandenbussche	A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations.	Math. Program.	2008	DBLP DOI BibTeX RDF	Nonconcave quadratic maximization, Nonconvex quadratic programming, Lift-and-project relaxations, Branch-and-bound, Semidefinite programming
22	Tetsu Iwata	Authenticated Encryption Mode for Beyond the Birthday Bound Security.	AFRICACRYPT	2008	DBLP DOI BibTeX RDF	birthday bound, modes of operation, authenticated encryption, security proofs, Blockcipher
22	Torsten Fahle, Karsten Tiemann	A faster branch-and-bound algorithm for the test-cover problem based on set-covering techniques.	ACM J. Exp. Algorithmics	2006	DBLP DOI BibTeX RDF	test-cover problem, variable fixing, Branch-and-bound, Lagrangian relaxation, set-cover problem
22	Irit Katriel, Sven Thiel	Complete Bound Consistency for the Global Cardinality Constraint.	Constraints An Int. J.	2005	DBLP DOI BibTeX RDF	global cardinality constraint, matching, graph algorithms, flow, constraint propagation, global constraints, arc consistency, filtering algorithms, bound consistency
22	Vincent T'kindt, Federico Della Croce, Carl Esswein	Revisiting Branch and Bound Search Strategies for Machine Scheduling Problems.	J. Sched.	2004	DBLP DOI BibTeX RDF	search tree strategies, dominance properties, branch and bound
22	Zhenxiao Wang, Jie Yang 0002, Guozheng Li 0001	An Improved Branch & Bound Algorithm in Feature Selection.	RSFDGrC	2003	DBLP DOI BibTeX RDF	Minimum Solution Tree, Global Optimum, Data Mining, Machine Learning, Pattern Recognition, Feature Selection, Branch & Bound
22	Isabel Dorta, Coromoto León, Casiano Rodríguez	A Comparison between MPI and OpenMP Branch-and-Bound Skeletons.	IPDPS	2003	DBLP DOI BibTeX RDF	MPI, Skeletons, Branch and Bound, OpenMP
22	Jürgen Garloff, Andrew P. Smith 0001	A Comparison of Methods for the Computation of Affine Lower Bound Functions for Polynomials.	COCOS	2003	DBLP DOI BibTeX RDF	complexity, global optimization, convex hull, control points, Bernstein polynomials, bound functions
22	Ranganath Nuggehalli, Timothy J. Lowe, James E. Ward	An Improved Lower Bound for the Multimedian Location Problem.	Ann. Oper. Res.	2002	DBLP DOI BibTeX RDF	location on networks, median problem, lower bound
22	Torsten Fahle	Simple and Fast: Improving a Branch-And-Bound Algorithm for Maximum Clique.	ESA	2002	DBLP DOI BibTeX RDF	branch-and-bound, constraint programming, maximum clique, cost based filtering
22	N. R. Achuthan, A. Hardjawidjaja	Project Scheduling under Time Dependent Costs - A Branch and Bound Algorithm.	Ann. Oper. Res.	2001	DBLP DOI BibTeX RDF	project compression, branch and bound, project scheduling
22	Sofia Eklund, Kalevi Pessi	Exploring Mobile eCommerce in Graphical Bound Retailing.	HICSS	2001	DBLP DOI BibTeX RDF	geographical bound services, mobility, recommender systems, electronic commerce
22	Christoph Burnikel, Rudolf Fleischer, Kurt Mehlhorn, Stefan Schirra	A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Radicals.	Algorithmica	2000	DBLP DOI BibTeX RDF	Separation bound, Exact geometric computation
22	R. Neil Braithwaite, Bir Bhanu	Error bound for multi-stage synthesis of narrow bandwidth Gabor filters.	ICIP	1995	DBLP DOI BibTeX RDF	narrow bandwidth Gabor filters, multistage synthesis, weighted sum, spatially offset separable kernels, frequency offset, spatial subsampling rate, multistage filtering, general basis filter set design, error analysis, filtering theory, error bound, network synthesis
22	Wael A. Hashlamoun, Pramod K. Varshney, V. N. S. Samarasooriya	A Tight Upper Bound on the Bayesian Probability of Error.	IEEE Trans. Pattern Anal. Mach. Intell.	1994	DBLP DOI BibTeX RDF	tight upper bound, Bayesian probability, minimum error probability, pattern recognition, probability, decision theory, Bayes methods, statistical pattern recognition
22	Yishay Mansour, Baruch Schieber, Prasoon Tiwari	A Lower Bound for Integer Greatest Common Divisor Computations.	J. ACM	1991	DBLP DOI BibTeX RDF	floor operation, greatest common devisor, mod operation, lower bound, truncation
22	Craig H. Richardson, Ronald W. Schafer	A Lower Bound for Structuring Element Decompositions.	IEEE Trans. Pattern Anal. Mach. Intell.	1991	DBLP DOI BibTeX RDF	morphological structuring elements, lower bound, picture processing, picture processing, optimisation, decomposition
22	Chee Fen Yu, Benjamin W. Wah	Efficient Branch-and-Bound Algorithms on a Two-Level Memory System.	IEEE Trans. Software Eng.	1988	DBLP DOI BibTeX RDF	two-level memory system, storage management, virtual-memory, storage allocation, depth-first search, branch-and-bound algorithms, virtual storage, best-first search
22	Michael J. Quinn, Narsingh Deo	An Upper Bound for the Speedup of Parallel Best-Bound Branch-And-Bound Algorithms.	BIT	1986	DBLP DOI BibTeX RDF
22	Hatem M. Bahig	Improved Generation of Minimal Addition Chains.	Computing	2006	DBLP DOI BibTeX RDF	nonstar lower bound, sorting, branch and bound algorithm, Addition chain
22	Hiroyuki Miyazawa, Thomas Erlebach	An Improved Randomized On-Line Algorithm for a Weighted Interval Selection Problem.	J. Sched.	2004	DBLP DOI BibTeX RDF	interval scheduling, lower bound, randomized algorithm, competitive analysis, upper bound, on-line algorithm
22	Dar-Tzen Peng, Kang G. Shin, Tarek F. Abdelzaher	Assignment and Scheduling Communicating Periodic Tasks in Distributed Real-Time Systems.	IEEE Trans. Software Eng.	1997	DBLP DOI BibTeX RDF	Branch-and-bound (B&B) algorithm, computation and communication modules, precedence and timing constraints, task invocation and release times, lower-bound cost, intertask communication
22	Woohyuk Lee, Abelardo Pardo, Jae-Young Jang, Gary D. Hachtel, Fabio Somenzi	Tearing based automatic abstraction for CTL model checking.	ICCAD	1996	DBLP DOI BibTeX RDF	ACTL model checking, CTL model checking, conservative ECTL, lattice set, lower bound approximations, pseudo-optimal shortest path, resolution methods, tearing based automatic abstraction, upper bound approximations, formal verification, reactive system, bipartition
22	William Blume, Rudolf Eigenmann	Symbolic range propagation.	IPPS	1995	DBLP DOI BibTeX RDF	symbolic range propagation, arbitrary symbolic expressions, Polaris, zero-trip loops, array sections, loop iteration-count estimation, lower bound, transformations, program test, program compilers, upper bound, parallelizing compiler, symbol manipulation, parallelising compilers
21	Jocelyn Aulin, Djordje Jeremic	Performance Bounds for MLSD Reception of OFDM Signals in Fast Fading.	ICC	2008	DBLP DOI BibTeX RDF
21	Timothy M. Chan	On levels in arrangements of curves, iii: further improvements.	SCG	2008	DBLP DOI BibTeX RDF	k-levels, k-sets, arrangements, combinatorial geometry
21	Yingbin Liang, Gerhard Kramer	Rate Regions for Relay Broadcast Channels.	IEEE Trans. Inf. Theory	2007	DBLP DOI BibTeX RDF
21	Ilia Rapoport, Yaakov Oshman	Weiss-Weinstein Lower Bounds for Markovian Systems. Part 1: Theory.	IEEE Trans. Signal Process.	2007	DBLP DOI BibTeX RDF
21	Madhavan Vajapeyam, Jifeng Geng, Urbashi Mitra	Tools for Performance Analysis and Design of Space-Time Block Codes.	IEEE Trans. Commun.	2007	DBLP DOI BibTeX RDF
21	Martin B. Haugh, Ashish Jain	Path-wise estimators and cross-path regressions: an application to evaluating portfolio strategies.	WSC	2007	DBLP DOI BibTeX RDF
21	Nathaniel John King, Neil D. Lawrence	Fast Variational Inference for Gaussian Process Models Through KL-Correction.	ECML	2006	DBLP DOI BibTeX RDF
21	Vineet Bafna, Vikas Bansal 0001	Improved Recombination Lower Bounds for Haplotype Data.	RECOMB	2005	DBLP DOI BibTeX RDF
21	Scot Anderson, Peter Z. Revesz	Verifying the Incorrectness of Programs and Automata.	SARA	2005	DBLP DOI BibTeX RDF
21	José María López, José Luis Díaz, Daniel F. García	Minimum and Maximum Utilization Bounds for Multiprocessor Rate Monotonic Scheduling.	IEEE Trans. Parallel Distributed Syst.	2004	DBLP DOI BibTeX RDF
21	Hartmut Klauck	Rectangle Size Bounds and Threshold Covers in Communication Complexity.	CCC	2003	DBLP DOI BibTeX RDF
21	Kazuhito Ito, Keshab K. Parhi	Determining the minimum iteration period of an algorithm.	J. VLSI Signal Process.	1995	DBLP DOI BibTeX RDF
21	John W. Carr III	Error Bounds for the Runge-Kutta Single-Step Integration Process.	J. ACM	1958	DBLP DOI BibTeX RDF
21	Aaron B. Wagner, Venkat Anantharam	An Improved Outer Bound for Multiterminal Source Coding.	IEEE Trans. Inf. Theory	2008	DBLP DOI BibTeX RDF
21	Eric Chaumette, Jérôme Galy, Angela Quinlan, Pascal Larzabal	A New Barankin Bound Approximation for the Prediction of the Threshold Region Performance of Maximum Likelihood Estimators.	IEEE Trans. Signal Process.	2008	DBLP DOI BibTeX RDF
21	Anup Rao 0001	Parallel repetition in projection games and a concentration bound.	STOC	2008	DBLP DOI BibTeX RDF	chsh game, parallel repetition, unique games conjecture
21	Tianping Shuai, Donglei Du	A Lower Bound for the On-Line Preemptive Machine Scheduling with lp.	COCOON	2008	DBLP DOI BibTeX RDF
21	Peter Auer, Ronald Ortner	A new PAC bound for intersection-closed concept classes.	Mach. Learn.	2007	DBLP DOI BibTeX RDF	PAC bounds, Intersection-closed classes
21	Chandra Nair, Abbas El Gamal	An Outer Bound to the Capacity Region ofthe Broadcast Channel.	IEEE Trans. Inf. Theory	2007	DBLP DOI BibTeX RDF
21	Alexandre Renaux, Leïla Najjar Atallah, Philippe Forster, Pascal Larzabal	A Useful Form of the Abel Bound and Its Application to Estimator Threshold Prediction.	IEEE Trans. Signal Process.	2007	DBLP DOI BibTeX RDF
21	Mi Zhou, Man Hon Wong 0001	Boundary-Based Lower-Bound Functions for Dynamic Time Warping and Their Indexing.	ICDE	2007	DBLP DOI BibTeX RDF
21	Jianjia Wu, Jyh-Charn Liu, Wei Zhao 0001	Utilization-Bound Based Schedulability Analysis of Weighted Round Robin Schedulers.	RTSS	2007	DBLP DOI BibTeX RDF
21	Ruxin Qin, Jing Chen, Naiyang Deng, Yingjie Tian 0001	A Leave-One-Out Bound for nu-Support Vector Regression.	International Conference on Computational Science (3)	2007	DBLP DOI BibTeX RDF
21	Xiaoyu Liu	Weights Modulo a Prime Power in Divisible Codes and a Related Bound.	IEEE Trans. Inf. Theory	2006	DBLP DOI BibTeX RDF
21	Stephanie Perkins, Alexander L. Sakhnovich, Derek H. Smith	On an upper bound for mixed error-correcting codes.	IEEE Trans. Inf. Theory	2006	DBLP DOI BibTeX RDF
21	Giuseppe Ateniese, Alfredo De Santis, Anna Lisa Ferrara, Barbara Masucci	Provably-secure time-bound hierarchical key assignment schemes.	CCS	2006	DBLP DOI BibTeX RDF	access control, provable security, key assignment
21	Li-Te Huang, Shan-Tai Chen, Shun-Shii Lin	Exact-Bound Analyzes and Optimal Strategies for Mastermind with a Lie.	ACG	2006	DBLP DOI BibTeX RDF
21	Yuelin Gao, Chengxian Xu, Jimin Li	Linear Programming Relax-PSO Hybrid Bound Algorithm for a Class of Nonlinear Integer Programming Problems.	CIS	2006	DBLP DOI BibTeX RDF
21	Ambighairajah Yasotharan	Lower bound on the BER of a pre- and postequalized vector communication system.	IEEE Trans. Commun.	2005	DBLP DOI BibTeX RDF
21	Jianhua Xu	Designing Nonlinear Classifiers Through Minimizing VC Dimension Bound.	ISNN (1)	2005	DBLP DOI BibTeX RDF
21	Chu Min Li, Felip Manyà, Jordi Planes	Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers.	CP	2005	DBLP DOI BibTeX RDF
21	Zili Shao, Chun Xue, Qingfeng Zhuge, Edwin Hsing-Mean Sha, Bin Xiao 0001	Efficient Array & Pointer Bound Checking Against Buffer Overflow Attacks via Hardware/Software.	ITCC (1)	2005	DBLP DOI BibTeX RDF
21	Shahram Yousefi, Amir K. Khandani	A new upper bound on the ML decoding error probability of linear binary block codes in AWGN interference.	IEEE Trans. Inf. Theory	2004	DBLP DOI BibTeX RDF
21	James H. Anderson, Yong-Jik Kim	An improved lower bound for the time complexity of mutual exclusion.	Distributed Comput.	2002	DBLP DOI BibTeX RDF	Lower bounds, Shared memory, Time complexity, Mutual exclusion, Atomicity, Local spinning
21	Salil S. Kanhere, Harish Sethu	On the Latency Bound of Pre-Order Deficit Round Robin.	LCN	2002	DBLP DOI BibTeX RDF
21	Chen Li 0003, Chee-Keng Yap	A new constructive root bound for algebraic expressions.	SODA	2001	DBLP BibTeX RDF
21	Liam Keliher, Henk Meijer, Stafford E. Tavares	Improving the Upper Bound on the Maximum Average Linear Hull Probability for Rijndael.	Selected Areas in Cryptography	2001	DBLP DOI BibTeX RDF
21	Svetla Nikova, Ventzislav Nikov	Improvement of the Delsarte Bound for tau-Designs in Finite Polynomial Metric Spaces.	IMACC	2001	DBLP DOI BibTeX RDF
21	Lars Kruse, Eike Schmidt, Gerd Jochens, Ansgar Stammermann, Wolfgang Nebel	Lower Bound Estimation for Low Power High-Level Synthesis.	ISSS	2000	DBLP DOI BibTeX RDF
21	Martin Dietzfelbinger, Juraj Hromkovic, Georg Schnitger	A Comparison of Two Lower Bound Methods for Communication Complexity.	MFCS	1994	DBLP DOI BibTeX RDF
21	V. J. de Jong	Symbolic dimension bound checking in a matrix language.	ICCL	1988	DBLP DOI BibTeX RDF
21	Toshihide Ibaraki	The Power of Dominance Relations in Branch-and-Bound Algorithms.	J. ACM	1977	DBLP DOI BibTeX RDF
20	Leah Epstein, Thomas Erlebach, Asaf Levin	Variable Sized Online Interval Coloring with Bandwidth.	Algorithmica	2009	DBLP DOI BibTeX RDF	Interval coloring, Approximation algorithm, Lower bound, Competitive analysis
20	Zaichen Qian, Evangeline F. Y. Young	Multi-voltage floorplan design with optimal voltage assignment.	ISPD	2009	DBLP DOI BibTeX RDF	multi-voltage assignment optimization branch-and-bound
20	Tal Mizrahi, Yoram Moses	Continuous Consensus with Failures and Recoveries.	DISC	2008	DBLP DOI BibTeX RDF	Continuous Consensus, Early decision, Process recovery, Round-based computation model, Synchronous message-passing system, Distributed algorithm, Lower bound, Modularity, Consensus, Agreement problem, Common Knowledge, Simultaneity, Omission failures, Process crash failure
20	Zuosong Liang, Erfang Shan, T. C. Edwin Cheng	Clique-Transversal Sets in Cubic Graphs.	ESCAPE	2007	DBLP DOI BibTeX RDF	Clique-transversal number, Claw-free, Bound, Cubic graph
20	Daniel Kunkle, Gene Cooperman	Twenty-six moves suffice for Rubik's cube.	ISSAC	2007	DBLP DOI BibTeX RDF	Rubik's cube, disk-based methods, fast multiplication, upper bound, permutation groups
20	Elad Barkan, Eli Biham, Adi Shamir	Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs.	CRYPTO	2006	DBLP DOI BibTeX RDF	Time/memory tradeoff, time/memory/data tradeoff, hidden state, stateful random graph, Hellman, lower bound, Cryptanalysis, rigorous, Rainbow
20	Arno Eigenwillig, Vikram Sharma 0001, Chee-Keng Yap	Almost tight recursion tree bounds for the Descartes method.	ISSAC	2006	DBLP DOI BibTeX RDF	Davenport-Mahler bound, Descartes method, Descartes rule of signs, polynomial real root isolation, Bernstein basis
20	Jun (Jim) Xu, Richard J. Lipton	On fundamental tradeoffs between delay bounds and computational complexity in packet scheduling algorithms.	IEEE/ACM Trans. Netw.	2005	DBLP DOI BibTeX RDF	quality of service, computational complexity, decision tree, packet scheduling, delay bound
20	Chang-Gun Lee, Lui Sha	Enhanced Processor Budget for QoS Management in Multimedia Systems.	IPDPS	2003	DBLP DOI BibTeX RDF	QoS, multimedia, resource reservation, fixed-priority scheduling, utilization bound
20	Quan T. Nguyen, Saïd Bettayeb	The upper bound and lower bound of the genus of pancake graphs.	ISCC	2009	DBLP DOI BibTeX RDF
20	George Christodoulou 0001, Elias Koutsoupias, Angelina Vidali	A Lower Bound for Scheduling Mechanisms.	Algorithmica	2009	DBLP DOI BibTeX RDF	Scheduling unrelated machines, Lower bound, Algorithmic mechanism design
20	Antanas Zilinskas, Julius Zilinskas	Branch and bound algorithm for multidimensional scaling with city-block metric.	J. Glob. Optim.	2009	DBLP DOI BibTeX RDF	City-block metric, Branch and bound, Multidimensional scaling
20	Yu-Fang Chung, Tzer-Shyong Chen, Chia-Chao Ho, Yi-Hsuan Yeh, Hsiu-Chia Ko	Hierarchical Time-Bound Key Management for Mobile Agents.	ICA3PP	2009	DBLP DOI BibTeX RDF	Time-bound Key Management, Access Control, Mobile Agent, Key Management, Elliptic Curve Cryptosystem