|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 23 occurrences of 23 keywords
|
|
|
Results
Found 30 publication records. Showing 30 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
73 | Heiner Ackermann, Alantha Newman, Heiko Röglin, Berthold Vöcking |
Decision Making Based on Approximate and Smoothed Pareto Curves.  |
ISAAC  |
2005 |
DBLP DOI BibTeX RDF |
|
42 | Mihalis Yannakakis |
Approximation of Multiobjective Optimization Problems.  |
WADS  |
2001 |
DBLP DOI BibTeX RDF |
|
38 | Mihalis Yannakakis |
Succinct Approximation of Trade-Off Curves.  |
WINE  |
2006 |
DBLP DOI BibTeX RDF |
|
38 | Sergei Vassilvitskii, Mihalis Yannakakis |
Efficiently Computing Succinct Trade-Off Curves.  |
ICALP  |
2004 |
DBLP DOI BibTeX RDF |
|
34 | Jack J. Dongarra, Emmanuel Jeannot, Erik Saule, Zhiao Shi |
Bi-objective scheduling algorithms for optimizing makespan and reliability on heterogeneous systems.  |
SPAA  |
2007 |
DBLP DOI BibTeX RDF |
pareto-curve, scheduling, reliability, DAG |
31 | Eric Angel, Evripidis Bampis, Laurent Gourvès |
Approximating the Pareto Curve with Local Search for the Bicriteria TSP (1, 2) Problem.  |
FCT  |
2003 |
DBLP DOI BibTeX RDF |
|
29 | Ilias Diakonikolas, Mihalis Yannakakis |
Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems.  |
APPROX-RANDOM  |
2007 |
DBLP DOI BibTeX RDF |
|
29 | Krishnendu Chatterjee |
Markov Decision Processes with Multiple Long-Run Average Objectives.  |
FSTTCS  |
2007 |
DBLP DOI BibTeX RDF |
|
29 | Krishnendu Chatterjee, Rupak Majumdar, Thomas A. Henzinger |
Markov Decision Processes with Multiple Objectives.  |
STACS  |
2006 |
DBLP DOI BibTeX RDF |
|
29 | Vittorio Bilò, Michele Flammini, Luca Moscardelli |
Pareto Approximations for the Bicriteria Scheduling Problem.  |
IPDPS  |
2004 |
DBLP DOI BibTeX RDF |
|
27 | Kousha Etessami, Marta Z. Kwiatkowska, Moshe Y. Vardi, Mihalis Yannakakis |
Multi-objective Model Checking of Markov Decision Processes.  |
TACAS  |
2007 |
DBLP DOI BibTeX RDF |
|
24 | René Beier, Berthold Vöcking |
An Experimental Study of Random Knapsack Problems.  |
Algorithmica  |
2006 |
DBLP DOI BibTeX RDF |
Random instances, Pareto optimality, Knapsack problem, Experimental study |
23 | Christos H. Papadimitriou, Mihalis Yannakakis |
On the Approximability of Trade-offs and Optimal Access of Web Sources.  |
FOCS  |
2000 |
DBLP DOI BibTeX RDF |
Web sources, optimal access, cost criteria, Pareto curve, polynomially succinct curve, multiple linear objectives, cost-time-quality trade-off, information retrieval, World-Wide Web, computational complexity, complexity, approximability, optimisation, multiobjective optimization, information resources, trade-offs, combinatorial mathematics, combinatorial optimization problem, hyperplane |
22 | Marlene Goncalves, Maria-Esther Vidal |
Preferred Skyline: A Hybrid Approach Between SQLf and Skyline.  |
DEXA  |
2005 |
DBLP DOI BibTeX RDF |
|
20 | Nicola Gatti 0001, Tuomas Sandholm |
Finding the pareto curve in bimatrix games is easy.  |
AAMAS  |
2014 |
DBLP BibTeX RDF |
|
20 | Aleksandr Y. Aravkin, Rajiv Mittal, Hassan Mansour, Ben Recht, Felix J. Herrmann |
An SVD-free Pareto curve approach to rank minimization  |
CoRR  |
2013 |
DBLP BibTeX RDF |
|
20 | Mehrdad Yaghoobi, Mike E. Davies 0001 |
Dictionary Learning for Sparse Representations: A Pareto Curve Root Finding Approach.  |
LVA/ICA  |
2010 |
DBLP DOI BibTeX RDF |
|
20 | Boris Y. L. Chan, Vincent Ng 0002, Jacob Sun |
Hierarchical Pareto Curve (HPC) Model for Privacy Skyline.  |
SMC  |
2009 |
DBLP DOI BibTeX RDF |
|
20 | Eric Angel, Evripidis Bampis, Laurent Gourvès |
Approximating the Pareto curve with local search for the bicriteria TSP(1, 2) problem.  |
Theor. Comput. Sci.  |
2004 |
DBLP DOI BibTeX RDF |
|
18 | Qubo Hu, Per Gunnar Kjeldsberg, Arnout Vandecappelle, Martin Palkovic, Francky Catthoor |
Incremental hierarchical memory size estimation for steering of loop transformations.  |
ACM Trans. Design Autom. Electr. Syst.  |
2007 |
DBLP DOI BibTeX RDF |
Data optimization, memory architecture exploration, memory size estimation, high-level synthesis, code transformation |
18 | René Beier, Berthold Vöcking |
An Experimental Study of Random Knapsack Problems.  |
ESA  |
2004 |
DBLP DOI BibTeX RDF |
|
11 | Thomas A. Henzinger |
From Boolean to quantitative notions of correctness.  |
POPL  |
2010 |
DBLP DOI BibTeX RDF |
quantitative specification, quantitative synthesis, quantitative analysis |
11 | Jia-Ying Tzeng, Tung-Kuan Liu, Jyh-Horng Chou |
Applications of Multi-objective Evolutionary Algorithms to Cluster Tool Evolutionary Algorithms to Cluster Tool.  |
ICICIC (2)  |
2006 |
DBLP DOI BibTeX RDF |
|
11 | Giovanni Beltrame, Dario Bruschi, Donatella Sciuto, Cristina Silvano |
Decision-theoretic exploration of multiProcessor platforms.  |
CODES+ISSS  |
2006 |
DBLP DOI BibTeX RDF |
|
11 | Martin Palkovic, Henk Corporaal, Francky Catthoor |
Global Memory Optimisation for Embedded Systems Allowed by Code Duplication.  |
SCOPES  |
2005 |
DBLP DOI BibTeX RDF |
|
11 | Marlene Goncalves, Maria-Esther Vidal |
Top-k Skyline: A Unified Approach.  |
OTM Workshops  |
2005 |
DBLP DOI BibTeX RDF |
|
11 | Márcio Eduardo Kreutz, César A. M. Marcon, Luigi Carro, Flávio Rech Wagner, Altamiro Amadeu Susin |
Design space exploration comparing homogeneous and heterogeneous network-on-chip architectures.  |
SBCCI  |
2005 |
DBLP DOI BibTeX RDF |
mapping and optimization algorithms, systems-on-chip, networks-on-chip |
11 | Peng Yang, Francky Catthoor |
Dynamic Mapping and Ordering Tasks of Embedded Real-Time Systems on Multiprocessor Platforms.  |
SCOPES  |
2004 |
DBLP DOI BibTeX RDF |
|
11 | Eric Angel, Evripidis Bampis, Alexander V. Kononov |
A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costs.  |
ESA  |
2001 |
DBLP DOI BibTeX RDF |
|
11 | Christos H. Papadimitriou, Mihalis Yannakakis |
Multiobjective Query Optimization. (PDF / PS)  |
PODS  |
2001 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #30 of 30 (100 per page; Change: )
|
|