|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 3338 occurrences of 1721 keywords
|
|
|
Results
Found 7302 publication records. Showing 7300 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
24 | Andreea Vescan, Crina Grosan |
A Hybrid Evolutionary Multiobjective Approach for the Component Selection Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HAIS ![In: Hybrid Artificial Intelligence Systems, Third International Workshop, HAIS 2008, Burgos, Spain, September 24-26, 2008. Proceedings, pp. 164-171, 2008, Springer, 978-3-540-87655-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 155(1), pp. 79-105, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Workforce scheduling, Local search, Hybrid algorithms, Greedy heuristics |
24 | Chandra Chekuri, Sanjeev Khanna |
Edge-disjoint paths revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 3(4), pp. 46, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 11(10), pp. 911-921, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2006, 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings, pp. 376-386, 2006, Springer, 3-540-38875-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
small world, greedy routing, doubling dimension |
24 | Fatih Gelgi, Melih Onus |
Heuristics for Minimum Brauer Chain Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCIS ![In: Computer and Information Sciences - ISCIS 2006, 21th International Symposium, Istanbul, Turkey, November 1-3, 2006, Proceedings, pp. 47-54, 2006, Springer, 3-540-47242-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2006, Proceedings, Seattle, Washington, USA, July 8-12, 2006, pp. 553-558, 2006, ACM, 1-59593-186-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HPDC ![In: Proceedings of the 15th IEEE International Symposium on High Performance Distributed Computing, HPDC-15, Paris, France, June 19-23, 2006, pp. 267-278, 2006, IEEE, 1-4244-0307-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 37(1), pp. 15-29, 2005. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM SIGSOFT Softw. Eng. Notes ![In: ACM SIGSOFT Softw. Eng. Notes 30(4), pp. 1-7, 2005. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
A-MOST ![In: Proceedings of the ICSE 2005 Workshop on Advances in Model-Based Software Testing, A-MOST 2005, St. Louis, Missouri, USA, 2005, ACM, 1-59593-115-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Telecommun. Syst. ![In: Telecommun. Syst. 22(1-4), pp. 109-118, 2003. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 7(2), pp. 179-207, 2003. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 8th Annual International Conference, COCOON 2002, Singapore, August 15-17, 2002, Proceedings, pp. 181-190, 2002, Springer, 3-540-43996-X. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. VLSI Signal Process. ![In: J. VLSI Signal Process. 25(3), pp. 199-213, 2000. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 9(11), pp. 1088-1101, 1998. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, WG '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings, pp. 2-16, 1996, Springer, 3-540-62559-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 60(11), pp. 1571-1580, 2011. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP ![In: International Conference on Parallel Processing, ICPP 2011, Taipei, Taiwan, September 13-16, 2011, pp. 454-463, 2011, IEEE Computer Society, 978-1-4577-1336-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIT ![In: 10th IEEE International Conference on Computer and Information Technology, CIT 2010, Bradford, West Yorkshire, UK, June 29-July 1, 2010, pp. 2662-2667, 2010, IEEE Computer Society, 978-0-7695-4108-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: The 10th International Symposium on Pervasive Systems, Algorithms, and Networks, ISPAN 2009, Kaohsiung, Taiwan, December 14-16, 2009, pp. 326-331, 2009, IEEE Computer Society, 978-0-7695-3908-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Heuristics ![In: J. Heuristics 14(2), pp. 169-181, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Vehicular Ad Hoc Networks ![In: Proceedings of the Third International Workshop on Vehicular Ad Hoc Networks, VANET 2006, Los Angeles, CA, USA, September 29, 2007, pp. 88-89, 2006, ACM, 1-59593-540-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
city environment, VANET, greedy routing |
23 | Petr Slavík |
A Tight Analysis of the Greedy Algorithm for Set Cover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, Philadelphia, Pennsylvania, USA, May 22-24, 1996, pp. 435-441, 1996, ACM, 0-89791-785-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 32(8), pp. 777-782, 1983. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 32(10), pp. 953-957, 1983. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITiCSE ![In: Proceedings of the 16th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, ITiCSE 2011, Darmstadt, Germany, June 27-29, 2011, pp. 366, 2011, ACM, 978-1-4503-0697-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMETRICS ![In: SIGMETRICS 2010, Proceedings of the 2010 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, New York, New York, USA, 14-18 June 2010, pp. 167-178, 2010, ACM, 978-1-4503-0038-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Mob. Comput. ![In: IEEE Trans. Mob. Comput. 8(2), pp. 203-217, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
21 | Bryant A. Julstrom |
String- and permutation-coded genetic algorithms for the static weapon-target assignment problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO (Companion) ![In: Genetic and Evolutionary Computation Conference, GECCO 2009, Proceedings, Montreal, Québec, Canada, July 8-12, 2009, Companion Material, pp. 2553-2558, 2009, ACM, 978-1-60558-505-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August 21-23, 2009. Proceedings, pp. 111-124, 2009, Springer, 978-3-642-03684-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
21 | Colin Lemmon, Phillip Musumeci |
Boundary Mapping and Boundary-State Routing (BSR) in Ad Hoc Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Mob. Comput. ![In: IEEE Trans. Mob. Comput. 7(1), pp. 127-139, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, pp. 982-991, 2008, SIAM. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
21 | Bin Ma 0002 |
Why Greed Works for Shortest Common Superstring Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 19th Annual Symposium, CPM 2008, Pisa, Italy, June 18-20, 2008, Proceedings, pp. 244-254, 2008, Springer, 978-3-540-69066-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
21 | Muhammad Hussain 0001 |
Fast Decimation of Polygonal Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISVC (1) ![In: Advances in Visual Computing, 4th International Symposium, ISVC 2008, Las Vegas, NV, USA, December 1-3, 2008. Proceedings, Part I, pp. 119-128, 2008, Springer, 978-3-540-89638-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INFOCOM ![In: INFOCOM 2008. 27th IEEE International Conference on Computer Communications, Joint Conference of the IEEE Computer and Communications Societies, 13-18 April 2008, Phoenix, AZ, USA, pp. 664-672, 2008, IEEE, 978-1-4244-2026-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
21 | Alexander Skopalik, Berthold Vöcking |
Inapproximability of pure nash equilibria. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pp. 355-364, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
approximation, local search, congestion games |
21 | Tiecheng Liu, John R. Kender |
Computational approaches to temporal sampling of video sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Multim. Comput. Commun. Appl. ![In: ACM Trans. Multim. Comput. Commun. Appl. 3(2), pp. 7, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 33(4), pp. 225-237, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PinKDD ![In: Privacy, Security, and Trust in KDD, First ACM SIGKDD International Workshop, PinKDD 2007, San Jose, CA, USA, August 12, 2007, Revised Selected Papers, pp. 33-55, 2007, Springer, 978-3-540-78477-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Adam Campbell, Annie S. Wu |
Learning and exploiting knowledge in multi-agent task allocation problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO (Companion) ![In: Genetic and Evolutionary Computation Conference, GECCO 2007, Proceedings, London, England, UK, July 7-11, 2007, Companion Material, pp. 2637-2642, 2007, ACM, 978-1-59593-698-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 55(1), pp. 2-17, 2006. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MobiHoc ![In: Proceedings of the 7th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2006, Florence, Italy, May 22-25, 2006, pp. 13-24, 2006, ACM, 1-59593-368-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MICRO ![In: 39th Annual IEEE/ACM International Symposium on Microarchitecture (MICRO-39 2006), 9-13 December 2006, Orlando, Florida, USA, pp. 309-320, 2006, IEEE Computer Society, 0-7695-2732-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Jan Struyf, Jesse Davis, C. David Page Jr. |
An Efficient Approximation to Lookahead in Relational Learners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECML ![In: Machine Learning: ECML 2006, 17th European Conference on Machine Learning, Berlin, Germany, September 18-22, 2006, Proceedings, pp. 775-782, 2006, Springer, 3-540-45375-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Joongseok Park, Sartaj Sahni |
Maximum Lifetime Broadcasting in Wireless Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 54(9), pp. 1081-1090, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
minimum energy broadcast trees, Wireless networks, network lifetime |
21 | Timo Poranen |
Heuristics for the Maximum Outerplanar Subgraph Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Heuristics ![In: J. Heuristics 11(1), pp. 59-88, 2005. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIP (2) ![In: Proceedings of the 2005 International Conference on Image Processing, ICIP 2005, Genoa, Italy, September 11-14, 2005, pp. 165-168, 2005, IEEE, 0-7803-9134-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
21 | Allan Borodin |
Towards a Theory of Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures, 9th International Workshop, WADS 2005, Waterloo, Canada, August 15-17, 2005, Proceedings, pp. 1, 2005, Springer, 3-540-28101-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
21 | Joongseok Park, Sartaj Sahni |
Maximum lifetime broadcasting in wireless networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AICCSA ![In: 2005 ACS / IEEE International Conference on Computer Systems and Applications (AICCSA 2005), January 3-6, 2005, Cairo, Egypt, pp. 8, 2005, IEEE Computer Society, 0-7803-8735-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
21 | Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail 0001, Katarzyna E. Paluch 0001 |
Rank-maximal matchings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004, pp. 68-75, 2004, SIAM, 0-89871-558-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
21 | Anil Menon |
Inequality's Arrow: The Role of Greed and Order in Genetic Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO (1) ![In: Genetic and Evolutionary Computation - GECCO 2004, Genetic and Evolutionary Computation Conference, Seattle, WA, USA, June 26-30, 2004, Proceedings, Part I, pp. 1352-1364, 2004, Springer, 3-540-22344-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
21 | Michael A. Palis |
Competitive Algorithms for Fine-Grain Real-Time Scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTSS ![In: Proceedings of the 25th IEEE Real-Time Systems Symposium (RTSS 2004), 5-8 December 2004, Lisbon, Portugal, pp. 129-138, 2004, IEEE Computer Society, 0-7695-2247-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DSN ![In: 2002 International Conference on Dependable Systems and Networks (DSN 2002), 23-26 June 2002, Bethesda, MD, USA, Proceedings, pp. 717-726, 2002, IEEE Computer Society, 0-7695-1597-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP ![In: 31st International Conference on Parallel Processing (ICPP 2002), 20-23 August 2002, Vancouver, BC, Canada, pp. 593-601, 2002, IEEE Computer Society, 0-7695-1677-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
21 | H. V. Jagadish, Hui Jin, Beng Chin Ooi, Kian-Lee Tan |
Global Optimization of Histograms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the 2001 ACM SIGMOD international conference on Management of data, Santa Barbara, CA, USA, May 21-24, 2001, pp. 223-234, 2001, ACM, 1-58113-332-4. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
21 | Lali Barrière, Pierre Fraigniaud, Evangelos Kranakis, Danny Krizanc |
Efficient Routing in Networks with Long Range Contacts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: Distributed Computing, 15th International Conference, DISC 2001, Lisbon, Portugal, October 3-5, 2001, Proceedings, pp. 270-284, 2001, Springer, 3-540-42605-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDCS Workshops ![In: 21st International Conference on Distributed Computing Systems Workshops (ICDCS 2001 Workshops), 16-19 April 2001, Phoenix, AZ, USA, Proceedings, pp. 461-466, 2001, IEEE Computer Society, 0-7695-1080-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
21 | Thomas Erlebach, Frits C. R. Spieksma |
Simple Algorithms for a Weighted Interval Selection Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 11th International Conference, ISAAC 2000, Taipei, Taiwan, December 18-20, 2000, Proceedings, pp. 228-240, 2000, Springer, 3-540-41255-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Design Autom. Electr. Syst. ![In: ACM Trans. Design Autom. Electr. Syst. 3(1), pp. 76-107, 1998. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Heterogeneous Computing Workshop ![In: Seventh Heterogeneous Computing Workshop, HCW 1998, Orlando, Florida, USA, March 30, 1998, pp. 79-, 1998, IEEE Computer Society, 0-8186-8365-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLDI ![In: Proceedings of the ACM SIGPLAN '97 Conference on Programming Language Design and Implementation (PLDI), Las Vegas, Nevada, USA, June 15-18, 1997, pp. 183-193, 1997, ACM, 0-89791-907-6. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
21 | Christos Levcopoulos, Andrzej Lingas, Cao Wang |
On Parallel Complexity of Planar Triangulations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, 15th Conference, Bangalore, India, December 18-20, 1995, Proceedings, pp. 413-427, 1995, Springer, 3-540-60692-0. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
21 | Avrim Blum, Tao Jiang 0001, Ming Li 0001, John Tromp, Mihalis Yannakakis |
Linear Approximation of Shortest Superstrings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 41(4), pp. 630-647, 1994. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Mob. Comput. ![In: IEEE Trans. Mob. Comput. 8(7), pp. 910-922, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 55(1), pp. 42-59, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 119(2), pp. 353-369, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IAS ![In: Proceedings of the Fifth International Conference on Information Assurance and Security, IAS 2009, Xi'An, China, 18-20 August 2009, pp. 445-450, 2009, IEEE Computer Society, 978-0-7695-3744-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
20 | Maren Martens |
A Simple Greedy Algorithm for the k-Disjoint Flow Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, 6th Annual Conference, TAMC 2009, Changsha, China, May 18-22, 2009. Proceedings, pp. 291-300, 2009, Springer, 978-3-642-02016-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
20 | Constantinos Marios Angelopoulos, Sotiris E. Nikoletseas |
Accelerated sensory data collection by greedy or aggregate mobility-based topology ranks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PE-WASUN ![In: Proceedings of the 6th ACM International Workshop on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks, PE-WASUN 2009, Tenerife, Canary Islands, Spain, October 28-29, 2009, pp. 63-70, 2009, ACM, 978-1-60558-618-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APNOMS ![In: Management Enabling the Future Internet for Changing Business and New Computing Services, 12th Asia-Pacific Network Operations and Management Symposium, APNOMS 2009, Jeju, South Korea, September 23-25, 2009, Proceedings, pp. 171-180, 2009, Springer, 978-3-642-04491-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Great Lakes Symposium on VLSI ![In: Proceedings of the 19th ACM Great Lakes Symposium on VLSI 2009, Boston Area, MA, USA, May 10-12 2009, pp. 445-450, 2009, ACM, 978-1-60558-522-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EMO ![In: Evolutionary Multi-Criterion Optimization, 5th International Conference, EMO 2009, Nantes, France, April 7-10, 2009. Proceedings, pp. 21-35, 2009, Springer, 978-3-642-01019-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
20 | Chandra Chekuri, Iftah Gamzu |
Truthful Mechanisms via Greedy Iterative Packing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August 21-23, 2009. Proceedings, pp. 56-69, 2009, Springer, 978-3-642-03684-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
20 | Eduardo Rodrigues Gomes, Ryszard Kowalczyk |
Dynamic analysis of multiagent Q-learning with ε-greedy exploration. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICML ![In: Proceedings of the 26th Annual International Conference on Machine Learning, ICML 2009, Montreal, Quebec, Canada, June 14-18, 2009, pp. 369-376, 2009, ACM, 978-1-60558-516-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Reliab. ![In: IEEE Trans. Reliab. 57(1), pp. 88-93, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adv. Comput. Math. ![In: Adv. Comput. Math. 28(1), pp. 23-41, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings, pp. 414-423, 2008, Springer, 978-3-540-92181-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICMLA ![In: Seventh International Conference on Machine Learning and Applications, ICMLA 2008, San Diego, California, USA, 11-13 December 2008, pp. 408-414, 2008, IEEE Computer Society, 978-0-7695-3495-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICC ![In: Proceedings of IEEE International Conference on Communications, ICC 2008, Beijing, China, 19-23 May 2008, pp. 2712-2716, 2008, IEEE. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICASSP ![In: Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2008, March 30 - April 4, 2008, Caesars Palace, Las Vegas, Nevada, USA, pp. 2129-2132, 2008, IEEE, 1-4244-1484-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
20 | Yalçin Akçay, Haijun Li, Susan H. Xu |
Greedy algorithm for the general multidimensional knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 150(1), pp. 17-29, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Heuristics, Integer programming, Multidimensional knapsack problems |
20 | Patrick S. Huggins, Steven W. Zucker |
Greedy Basis Pursuit. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Signal Process. ![In: IEEE Trans. Signal Process. 55(7-2), pp. 3760-3772, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
20 | Peng Cui 0008 |
A Tighter Analysis of Set Cover Greedy Algorithm for Test Set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESCAPE ![In: Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, First International Symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007, Revised Selected Papers, pp. 24-35, 2007, Springer, 978-3-540-74449-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IbPRIA (2) ![In: Pattern Recognition and Image Analysis, Third Iberian Conference, IbPRIA 2007, Girona, Spain, June 6-8, 2007, Proceedings, Part II, pp. 226-233, 2007, Springer, 978-3-540-72848-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings, pp. 49-60, 2007, Springer, 978-3-540-70917-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
20 | Ben Leong, Barbara Liskov, Robert Tappan Morris |
Greedy Virtual Coordinates for Geographic Routing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICNP ![In: Proceedings of the IEEE International Conference on Network Protocols, ICNP 2007, October 16-19, 2007, Beijing, China, pp. 71-80, 2007, IEEE Computer Society, 1-4244-1588-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPA ![In: Parallel and Distributed Processing and Applications, 5th International Symposium, ISPA 2007, Niagara Falls, Canada, August 29-31, 2007, Proceedings, pp. 633-644, 2007, Springer, 978-3-540-74741-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
20 | Jiayu Gong, Cheng-Zhong Xu 0001, James Holle |
Predictive Directional Greedy Routing in Vehicular Ad hoc Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDCS Workshops ![In: 27th International Conference on Distributed Computing Systems Workshops (ICDCS 2007 Workshops), June 25-29, 2007, Toronto, Ontario, Canada, pp. 2, 2007, IEEE Computer Society, 0-7695-2881-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
20 | Andre Tkacenko, P. P. Vaidyanathan |
Iterative greedy algorithm for solving the FIR paraunitary approximation problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Signal Process. ![In: IEEE Trans. Signal Process. 54(1), pp. 146-160, 2006. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIP ![In: Proceedings of the International Conference on Image Processing, ICIP 2006, October 8-11, Atlanta, Georgia, USA, pp. 1645-1648, 2006, IEEE, 1-4244-0480-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
20 | Ernesto Wandeler, Alexander Maxiaguine, Lothar Thiele |
Performance analysis of greedy shapers in real-time systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DATE ![In: Proceedings of the Conference on Design, Automation and Test in Europe, DATE 2006, Munich, Germany, March 6-10, 2006, pp. 444-449, 2006, European Design and Automation Association, Leuven, Belgium, 3-9810801-1-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
20 | Ioannis Caragiannis, Michele Flammini, Christos Kaklamanis, Panagiotis Kanellopoulos, Luca Moscardelli |
Tight Bounds for Selfish and Greedy Load Balancing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part I, pp. 311-322, 2006, Springer, 3-540-35904-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
20 | Qiulei Dong, Yihong Wu 0002, Zhanyi Hu |
Gesture Segmentation from a Video Sequence Using Greedy Similarity Measure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPR (1) ![In: 18th International Conference on Pattern Recognition (ICPR 2006), 20-24 August 2006, Hong Kong, China, pp. 331-334, 2006, IEEE Computer Society, 0-7695-2521-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
20 | Adrian Kosowski, Lukasz Kuszner |
On Greedy Graph Coloring in the Distributed Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Euro-Par ![In: Euro-Par 2006, Parallel Processing, 12th International Euro-Par Conference, Dresden, Germany, August 28 - September 1, 2006, Proceedings, pp. 592-601, 2006, Springer, 3-540-37783-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCNN ![In: Proceedings of the International Joint Conference on Neural Networks, IJCNN 2006, part of the IEEE World Congress on Computational Intelligence, WCCI 2006, Vancouver, BC, Canada, 16-21 July 2006, pp. 1833-1839, 2006, IEEE, 0-7803-9490-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIP (1) ![In: Proceedings of the 2005 International Conference on Image Processing, ICIP 2005, Genoa, Italy, September 11-14, 2005, pp. 629-632, 2005, IEEE, 0-7803-9134-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
20 | Christoforos L. Raptopoulos, Paul G. Spirakis |
Simple and Efficient Greedy Algorithms for Hamilton Cycles in Random Intersection Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings, pp. 493-504, 2005, Springer, 3-540-30935-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NPC ![In: Network and Parallel Computing, IFIP International Conference, NPC 2005, Beijing, China, November 30 - December 3, 2005, Proceedings, pp. 180-188, 2005, Springer, 3-540-29810-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
20 | Armin Fügenschuh |
Parametrized Greedy Heuristics in Theory and Practice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Hybrid Metaheuristics ![In: Hybrid Metaheuristics, Second International Workshop, HM 2005, Barcelona, Spain, August 29-30, 2005, Proceedings, pp. 21-31, 2005, Springer, 3-540-28535-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
Displaying result #201 - #300 of 7300 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ 12][ >>] |
|