Search results for "greedy"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
24	Andreea Vescan, Crina Grosan	A Hybrid Evolutionary Multiobjective Approach for the Component Selection Problem.	HAIS	2008	DBLP DOI BibTeX RDF	Component Selection, Hybrid evolutionary algorithms, Greedy
24	Luca Di Gaspero, Johannes Gärtner, Guy Kortsarz, Nysret Musliu, Andrea Schaerf, Wolfgang Slany	The minimum shift design problem.	Ann. Oper. Res.	2007	DBLP DOI BibTeX RDF	Workforce scheduling, Local search, Hybrid algorithms, Greedy heuristics
24	Chandra Chekuri, Sanjeev Khanna	Edge-disjoint paths revisited.	ACM Trans. Algorithms	2007	DBLP DOI BibTeX RDF	multicommodity flow relaxation, approximation algorithm, greedy algorithm, Edge-disjoint paths
24	Alok Singh 0001, Ashok Kumar Gupta	Improved heuristics for the bounded-diameter minimum spanning tree problem.	Soft Comput.	2007	DBLP DOI BibTeX RDF	Bounded-diameter minimum spanning tree problem, Uniform order-based crossover, Constrained optimization, Greedy heuristic, Steady-state genetic algorithm
24	Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker	A Doubling Dimension Threshold Theta(loglogn) for Augmented Graph Navigability.	ESA	2006	DBLP DOI BibTeX RDF	small world, greedy routing, doubling dimension
24	Fatih Gelgi, Melih Onus	Heuristics for Minimum Brauer Chain Problem.	ISCIS	2006	DBLP DOI BibTeX RDF	Brauer chain, dynamic programming, greedy algorithms, exponentiation, addition chain
24	Jeremiah Nummela, Bryant A. Julstrom	An effective genetic algorithm for the minimum-label spanning tree problem.	GECCO	2006	DBLP DOI BibTeX RDF	labeled spanning trees, spanning subgraphs, genetic algorithms, local search, greedy heuristics
24	Qinghua Zheng, Haijun Yang, Yuzhong Sun	How to avoid herd: a novel stochastic algorithm in grid scheduling.	HPDC	2006	DBLP DOI BibTeX RDF	multichoice algorithm, homogeneous balls, bins model, DHT, greedy algorithm, grid scheduling, stochastic algorithm
24	A. J. van Zanten, I Nengah Suparta	On the Construction of Linear q-ary Lexicodes.	Des. Codes Cryptogr.	2005	DBLP DOI BibTeX RDF	lexicodes, self-orthogonality, anticodes, greedy algorithm, linearity, self-duality
24	Renée C. Bryce, Charles J. Colbourn	Test prioritization for pairwise interaction coverage.	ACM SIGSOFT Softw. Eng. Notes	2005	DBLP DOI BibTeX RDF	biased covering arrays, pairwise interaction coverage, greedy algorithm, covering arrays, software interaction testing, mixed-level covering arrays
24	Renée C. Bryce, Charles J. Colbourn	Test prioritization for pairwise interaction coverage.	A-MOST	2005	DBLP DOI BibTeX RDF	biased covering arrays, pairwise interaction coverage, greedy algorithm, covering arrays, software interaction testing, mixed-level covering arrays
24	Pedro Acevedo Contla, Milos Stojmenovic	Estimating Hop Counts in Position Based Routing Schemes for Ad Hoc Networks.	Telecommun. Syst.	2003	DBLP DOI BibTeX RDF	routing, ad hoc networks, GPS, greedy algorithms
24	Wanpracha Art Chaovalitwongse, Dukwon Kim, Panos M. Pardalos	GRASP with a New Local Search Scheme for Vehicle Routing Problems with Time Windows.	J. Comb. Optim.	2003	DBLP DOI BibTeX RDF	vehicle routing with time windows, local search, greedy randomized adaptive search procedure
24	Wu Jigang, Heiko Schröder, Thambipillai Srikanthan	New Architecture and Algorithms for Degradable VLSI/WSI Arrays.	COCOON	2002	DBLP DOI BibTeX RDF	Degradable VLSI/WSI array, fault-tolerance, reconfiguration, NP-completeness, greedy algorithm
24	Ahmed F. Shalash, Keshab K. Parhi	Power Efficient Folding of Pipelined LMS Adaptive Filters with Applications to Wireline Digital Communications.	J. VLSI Signal Process.	2000	DBLP DOI BibTeX RDF	LMS design, power efficient folding, wireline communications, traveling sales person, relaxed LMS, low power design, greedy algorithm, algorithm transformation
24	Min Tan 0002, Howard Jay Siegel	A Stochastic Model for Heterogeneous Computing and Its Application in Data Relocation Scheme Development.	IEEE Trans. Parallel Distributed Syst.	1998	DBLP DOI BibTeX RDF	Data relocation, scheduling, optimization, mapping, matching, stochastic modeling, greedy algorithm, heterogeneous computing
24	Paola Alimonti, Tiziana Calamoneri	Improved Approximations of Independent Dominating Set in Bounded Degree Graphs.	WG	1996	DBLP DOI BibTeX RDF	Minimum Independent Dominating Set, Approximation Algorithms, Local Search, Greedy, Regular Graphs, Cubic Graphs, Bounded Degree Graphs
23	David Eppstein, Michael T. Goodrich	Succinct Greedy Geometric Routing Using Hyperbolic Geometry.	IEEE Trans. Computers	2011	DBLP DOI BibTeX RDF	autocratic weight-balanced trees, dyadic tree metric space, Greedy routing, hyperbolic geometry
23	Anne Benoit, Paul Renaud-Goud, Yves Robert	On the Performance of Greedy Algorithms for Power Consumption Minimization.	ICPP	2011	DBLP DOI BibTeX RDF	Independent jobs, Power consumption minimization, Greedy algorithm, Parallel processors
23	Hadi Noureddine, Qiang Ni, Geyong Min, Hamed S. Al-Raweshidy	A New Link Lifetime Prediction Method for Greedy and Contention-based Routing in Mobile Ad Hoc Networks.	CIT	2010	DBLP DOI BibTeX RDF	link lifetime estimation, greedy forwarding, link stability, contention-based routing
23	Lei Cao, Andrew Strelzoff, Jonathan Z. Sun	On Succinctness of Geometric Greedy Routing in Euclidean Plane.	ISPAN	2009	DBLP DOI BibTeX RDF	greedy embedding, complexity, coordinate, geometric routing
23	Gregory Z. Gutin, Boris Goldengorin, Jing Huang 0007	Worst case analysis of Max-Regret, Greedy and other heuristics for Multidimensional Assignment and Traveling Salesman Problems.	J. Heuristics	2008	DBLP DOI BibTeX RDF	Traveling salesman problem, Greedy heuristics, Multidimensional assignment problem, Domination analysis
23	Moez Jerbi, Rabah Meraihi, Sidi-Mohammed Senouci, Yacine Ghamri-Doudane	GyTAR: improved greedy traffic aware routing protocol for vehicular ad hoc networks in city environments.	Vehicular Ad Hoc Networks	2006	DBLP DOI BibTeX RDF	city environment, VANET, greedy routing
23	Petr Slavík	A Tight Analysis of the Greedy Algorithm for Set Cover.	STOC	1996	DBLP DOI BibTeX RDF	fractional set cover, partial set cover, approximation algorithms, greedy algorithm, set cover
23	Anton T. Dahbura, Gerald M. Masson	Greedy Diagnosis of Hybrid Fault Situations.	IEEE Trans. Computers	1983	DBLP DOI BibTeX RDF	greedy diagnosis, hybrid fault, incomplete diagnosis, fault tolerance, PMC models, intermittent fault, permanent fault, syndrome, Connection assignment, self-diagnosable system
23	Anton T. Dahbura, Gerald M. Masson	Greedy Diagnosis as the Basis of an Intermittent-Fault/Transient-Upset Tolerant System Design.	IEEE Trans. Computers	1983	DBLP DOI BibTeX RDF	transient upset, Allowable set, greedy diagnosis, incomplete diagnosis, fault tolerance, job scheduling, intermittent fault, syndrome, connection assignment
21	Robert Law	Using student blogs for documentation in software development projects.	ITiCSE	2011	DBLP DOI BibTeX RDF
21	Jian Ni, R. Srikant 0001, Xinzhou Wu	Coloring spatial point processes with applications to peer discovery in large wireless networks.	SIGMETRICS	2010	DBLP DOI BibTeX RDF	coloring algorithms, spatial point processes, wireless networks, channel assignment
21	Noa Arad, Yuval Shavitt	Minimizing Recovery State in Geographic Ad Hoc Routing.	IEEE Trans. Mob. Comput.	2009	DBLP DOI BibTeX RDF
21	Bryant A. Julstrom	String- and permutation-coded genetic algorithms for the static weapon-target assignment problem.	GECCO (Companion)	2009	DBLP DOI BibTeX RDF	maximum marginal return, weapon-target assignment problem, representations, coding, permutations
21	Uriel Feige, Nicole Immorlica, Vahab S. Mirrokni, Hamid Nazerzadeh	PASS Approximation.	APPROX-RANDOM	2009	DBLP DOI BibTeX RDF
21	Colin Lemmon, Phillip Musumeci	Boundary Mapping and Boundary-State Routing (BSR) in Ad Hoc Networks.	IEEE Trans. Mob. Comput.	2008	DBLP DOI BibTeX RDF	Algorithm, networks, wireless lan, packet switching, network routing
21	Gagan Goel, Aranyak Mehta	Online budgeted matching in random input models with applications to Adwords.	SODA	2008	DBLP BibTeX RDF
21	Bin Ma 0002	Why Greed Works for Shortest Common Superstring Problem.	CPM	2008	DBLP DOI BibTeX RDF
21	Muhammad Hussain 0001	Fast Decimation of Polygonal Models.	ISVC (1)	2008	DBLP DOI BibTeX RDF
21	Jay Cheng, Cheng-Shang Chang, Tsz-Hsuan Chao, Duan-Shin Lee, Ching-Ming Lien	On Constructions of Optical Queues with a Limited Number of Recirculations.	INFOCOM	2008	DBLP DOI BibTeX RDF
21	Alexander Skopalik, Berthold Vöcking	Inapproximability of pure nash equilibria.	STOC	2008	DBLP DOI BibTeX RDF	approximation, local search, congestion games
21	Tiecheng Liu, John R. Kender	Computational approaches to temporal sampling of video sequences.	ACM Trans. Multim. Comput. Commun. Appl.	2007	DBLP DOI BibTeX RDF	key frame selection, temporal video sampling, ubiquitous media access, Video summarization, video content analysis
21	Zheng Li 0002, Mark Harman, Robert M. Hierons	Search Algorithms for Regression Test Case Prioritization.	IEEE Trans. Software Eng.	2007	DBLP DOI BibTeX RDF	regression testing, test case prioritization, Search techniques
21	Rhonda Chaytor	Allowing Privacy Protection Algorithms to Jump Out of Local Optimums: An Ordered Greed Framework.	PinKDD	2007	DBLP DOI BibTeX RDF
21	Adam Campbell, Annie S. Wu	Learning and exploiting knowledge in multi-agent task allocation problems.	GECCO (Companion)	2007	DBLP DOI BibTeX RDF	multi-agent systems, task allocation
21	Bin Wu 0014, Ajay D. Kshemkalyani	Objective-Optimal Algorithms for Long-Term Web Prefetching.	IEEE Trans. Computers	2006	DBLP DOI BibTeX RDF	hit rate, optimal object selection, World Wide Web, randomized algorithm, bandwidth, Web server, Web caching, content distribution, Web prefetching, Web object
21	Noa Arad, Yuval Shavitt	Minimizing recovery state In geographic ad-hoc routing.	MobiHoc	2006	DBLP DOI BibTeX RDF	elevation, repositioning, routing, distributed, ad-hoc
21	Michael R. Marty, Mark D. Hill	Coherence Ordering for Ring-based Chip Multiprocessors.	MICRO	2006	DBLP DOI BibTeX RDF
21	Jan Struyf, Jesse Davis, C. David Page Jr.	An Efficient Approximation to Lookahead in Relational Learners.	ECML	2006	DBLP DOI BibTeX RDF
21	Joongseok Park, Sartaj Sahni	Maximum Lifetime Broadcasting in Wireless Networks.	IEEE Trans. Computers	2005	DBLP DOI BibTeX RDF	minimum energy broadcast trees, Wireless networks, network lifetime
21	Timo Poranen	Heuristics for the Maximum Outerplanar Subgraph Problem.	J. Heuristics	2005	DBLP DOI BibTeX RDF	triangular cactus heuristic, maximum outerplanar subgraph problem, simulated annealing
21	Christophe De Vleeschouwer, Pascal Frossard	The virtue of patience when scheduling media in presence of feedback.	ICIP (2)	2005	DBLP DOI BibTeX RDF
21	Allan Borodin	Towards a Theory of Algorithms.	WADS	2005	DBLP DOI BibTeX RDF
21	Joongseok Park, Sartaj Sahni	Maximum lifetime broadcasting in wireless networks.	AICCSA	2005	DBLP DOI BibTeX RDF
21	Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail 0001, Katarzyna E. Paluch 0001	Rank-maximal matchings.	SODA	2004	DBLP BibTeX RDF
21	Anil Menon	Inequality's Arrow: The Role of Greed and Order in Genetic Algorithms.	GECCO (1)	2004	DBLP DOI BibTeX RDF
21	Michael A. Palis	Competitive Algorithms for Fine-Grain Real-Time Scheduling.	RTSS	2004	DBLP DOI BibTeX RDF
21	Christoph Lindemann, Oliver P. Waldhorst	Evaluating the Impact of Different Document Types on the Performance of Web Cache Replacement Schemes.	DSN	2002	DBLP DOI BibTeX RDF
21	Dakai Zhu 0001, Nevine AbouGhazaleh, Daniel Mossé, Rami G. Melhem	Power Aware Scheduling for AND/OR Graphs in Multi-Processor Real-Time Systems.	ICPP	2002	DBLP DOI BibTeX RDF
21	H. V. Jagadish, Hui Jin, Beng Chin Ooi, Kian-Lee Tan	Global Optimization of Histograms.	SIGMOD Conference	2001	DBLP DOI BibTeX RDF
21	Lali Barrière, Pierre Fraigniaud, Evangelos Kranakis, Danny Krizanc	Efficient Routing in Networks with Long Range Contacts.	DISC	2001	DBLP DOI BibTeX RDF
21	Susanta Datta, Ivan Stojmenovic, Jie Wu 0001	Internal Node and Shortcut Based Routing with Guaranteed Delivery in Wireless Networks.	ICDCS Workshops	2001	DBLP DOI BibTeX RDF
21	Thomas Erlebach, Frits C. R. Spieksma	Simple Algorithms for a Weighted Interval Selection Problem.	ISAAC	2000	DBLP DOI BibTeX RDF
21	C.-J. Richard Shi, Janusz A. Brzozowski	Cluster-cover a theoretical framework for a class of VLSI-CAD optimization problems.	ACM Trans. Design Autom. Electr. Syst.	1998	DBLP DOI BibTeX RDF	cluster-cover, logic minimizaiton, self-checking logic design, topological routing, NP-completeness, state assignment
21	Robert Armstrong, Debra A. Hensgen, Taylor Kidd	The Relative Performance of Various Mapping Algorithms is Independent of Sizable Variances in Run-Time Predictions.	Heterogeneous Computing Workshop	1998	DBLP DOI BibTeX RDF	Run-time Distributions, Scheduling, Mapping, Heterogeneous Computing
21	Cliff Young, David S. Johnson, David R. Karger, Michael D. Smith 0001	Near-optimal Intraprocedural Branch Alignment.	PLDI	1997	DBLP DOI BibTeX RDF
21	Christos Levcopoulos, Andrzej Lingas, Cao Wang	On Parallel Complexity of Planar Triangulations.	FSTTCS	1995	DBLP DOI BibTeX RDF
21	Avrim Blum, Tao Jiang 0001, Ming Li 0001, John Tromp, Mihalis Yannakakis	Linear Approximation of Shortest Superstrings.	J. ACM	1994	DBLP DOI BibTeX RDF	shortest common superstring, approximation algorithm
20	Wen-Jiunn Liu, Kai-Ten Feng	Greedy Routing with Anti-Void Traversal for Wireless Sensor Networks.	IEEE Trans. Mob. Comput.	2009	DBLP DOI BibTeX RDF
20	Benjamin E. Birnbaum, Kenneth J. Goldman	An Improved Analysis for a Greedy Remote-Clique Algorithm Using Factor-Revealing LPs.	Algorithmica	2009	DBLP DOI BibTeX RDF	Factor-revealing linear programs, Remote-clique, Approximation algorithms, Dispersion
20	Ulrich Faigle, Satoru Fujishige	A general model for matroids and the greedy algorithm.	Math. Program.	2009	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C27, 68R99, 05B35
20	Ming Li, Kunpeng Wang	New Greedy Algorithm for Computing Double-Base Chains.	IAS	2009	DBLP DOI BibTeX RDF
20	Maren Martens	A Simple Greedy Algorithm for the k-Disjoint Flow Problem.	TAMC	2009	DBLP DOI BibTeX RDF
20	Constantinos Marios Angelopoulos, Sotiris E. Nikoletseas	Accelerated sensory data collection by greedy or aggregate mobility-based topology ranks.	PE-WASUN	2009	DBLP DOI BibTeX RDF	wireless sensor network, performance evaluation, routing, aggregation
20	Minh Thiep Ha, Priyadharshini Sakthivel, Hyunseung Choo	Bypassing Routing Holes in WSNs with a Predictive Geographic Greedy Forwarding.	APNOMS	2009	DBLP DOI BibTeX RDF	Routing hole problem, sensor networks
20	Yang Sun 0001, Joseph R. Cavallaro	High throughput VLSI architecture for soft-output mimo detection based on a greedy graph algorithm.	ACM Great Lakes Symposium on VLSI	2009	DBLP DOI BibTeX RDF	mimo detection, VLSI architecture, ASIC design
20	Nicola Beume, Boris Naujoks, Mike Preuss, Günter Rudolph, Tobias Wagner 0001	Effects of 1-Greedy -Metric-Selection on Innumerably Large Pareto Fronts.	EMO	2009	DBLP DOI BibTeX RDF
20	Chandra Chekuri, Iftah Gamzu	Truthful Mechanisms via Greedy Iterative Packing.	APPROX-RANDOM	2009	DBLP DOI BibTeX RDF
20	Eduardo Rodrigues Gomes, Ryszard Kowalczyk	Dynamic analysis of multiagent Q-learning with ε-greedy exploration.	ICML	2009	DBLP DOI BibTeX RDF
20	Wei-Chang Yeh	A Greedy Branch-and-Bound Inclusion-Exclusion Algorithm for Calculating the Exact Multi-State Network Reliability.	IEEE Trans. Reliab.	2008	DBLP DOI BibTeX RDF
20	Rémi Gribonval, Morten Nielsen 0002	Beyond sparsity: Recovering structured representations by l1{\ell}^1 minimization and greedy algorithms.	Adv. Comput. Math.	2008	DBLP DOI BibTeX RDF	Mathematics subject classification (2000) Primary 41A30, Secondary 65D16
20	Ali Civril, Malik Magdon-Ismail	Deterministic Sparse Column Based Matrix Reconstruction via Greedy Approximation of SVD.	ISAAC	2008	DBLP DOI BibTeX RDF
20	Mir Shahriar Emami	Optimization on a Novel Quantum Greedy Approach Based on Learning Strategy for Zero and One Knapsack Problem and Evaluation.	ICMLA	2008	DBLP DOI BibTeX RDF
20	Shao Tao, Akkihebbal L. Ananda, Mun Choon Chan	Greedy Hop Distance Routing Using Tree Recovery on Wireless Ad Hoc and Sensor Networks.	ICC	2008	DBLP DOI BibTeX RDF
20	Fan Jiang, Ying Wu 0001, Aggelos K. Katsaggelos	Abnormal event detection based on trajectory clustering by 2-depth greedy search.	ICASSP	2008	DBLP DOI BibTeX RDF
20	Yalçin Akçay, Haijun Li, Susan H. Xu	Greedy algorithm for the general multidimensional knapsack problem.	Ann. Oper. Res.	2007	DBLP DOI BibTeX RDF	Heuristics, Integer programming, Multidimensional knapsack problems
20	Patrick S. Huggins, Steven W. Zucker	Greedy Basis Pursuit.	IEEE Trans. Signal Process.	2007	DBLP DOI BibTeX RDF
20	Peng Cui 0008	A Tighter Analysis of Set Cover Greedy Algorithm for Test Set.	ESCAPE	2007	DBLP DOI BibTeX RDF
20	Noelia Barreira, Manuel G. Penedo, Óscar Ibáñez, José Santos Reyes	Automatic Topological Active Net Division in a Genetic-Greedy Hybrid Approach.	IbPRIA (2)	2007	DBLP DOI BibTeX RDF	Topological Active Nets, Hybrid Optimization Algorithms, Lamarckian Strategy, Genetic Algorithms
20	Manfred Kunde	A New Bound for Pure Greedy Hot Potato Routing.	STACS	2007	DBLP DOI BibTeX RDF
20	Ben Leong, Barbara Liskov, Robert Tappan Morris	Greedy Virtual Coordinates for Geographic Routing.	ICNP	2007	DBLP DOI BibTeX RDF
20	Reen-Cheng Wang, Su-Ling Wu, Ruay-Shiung Chang	Enhancing Data Replication with Greedy Pipeline-Based Aggressive Copy Protocol in Data Grids.	ISPA	2007	DBLP DOI BibTeX RDF
20	Jiayu Gong, Cheng-Zhong Xu 0001, James Holle	Predictive Directional Greedy Routing in Vehicular Ad hoc Networks.	ICDCS Workshops	2007	DBLP DOI BibTeX RDF
20	Andre Tkacenko, P. P. Vaidyanathan	Iterative greedy algorithm for solving the FIR paraunitary approximation problem.	IEEE Trans. Signal Process.	2006	DBLP DOI BibTeX RDF
20	Julien Mille, Romuald Boné, Pascal Makris, Hubert Cardot	Greedy Algorithm and Physics-Based Method for Active Contours and Surfaces: A Comparative Study.	ICIP	2006	DBLP DOI BibTeX RDF
20	Ernesto Wandeler, Alexander Maxiaguine, Lothar Thiele	Performance analysis of greedy shapers in real-time systems.	DATE	2006	DBLP DOI BibTeX RDF
20	Ioannis Caragiannis, Michele Flammini, Christos Kaklamanis, Panagiotis Kanellopoulos, Luca Moscardelli	Tight Bounds for Selfish and Greedy Load Balancing.	ICALP (1)	2006	DBLP DOI BibTeX RDF
20	Qiulei Dong, Yihong Wu 0002, Zhanyi Hu	Gesture Segmentation from a Video Sequence Using Greedy Similarity Measure.	ICPR (1)	2006	DBLP DOI BibTeX RDF
20	Adrian Kosowski, Lukasz Kuszner	On Greedy Graph Coloring in the Distributed Model.	Euro-Par	2006	DBLP DOI BibTeX RDF
20	Koichi Odajima, Yoichi Hayashi, Rudy Setiono	Greedy rule generation from discrete data and its use in neural network rule extraction.	IJCNN	2006	DBLP DOI BibTeX RDF
20	Pietro Zanuttigh, Nicola Brusco, David Taubman, Guido M. Cortelazzo	Greedy non-linear approximation of the plenoptic function for interactive transmission of 3D scenes.	ICIP (1)	2005	DBLP DOI BibTeX RDF
20	Christoforos L. Raptopoulos, Paul G. Spirakis	Simple and Efficient Greedy Algorithms for Hamilton Cycles in Random Intersection Graphs.	ISAAC	2005	DBLP DOI BibTeX RDF
20	Yifeng Chen, Yanxiang He, Jiannong Cao 0001, Jie Wu 0001	A Greedy Algorithm for Capacity-Constrained Surrogate Placement in CDNs.	NPC	2005	DBLP DOI BibTeX RDF
20	Armin Fügenschuh	Parametrized Greedy Heuristics in Theory and Practice.	Hybrid Metaheuristics	2005	DBLP DOI BibTeX RDF