The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Conferences in DBLP

Workshop on Experimental and Efficient Algorithms (wea)
2004 (conf/wea/2004)

  1. Adriana C. F. Alvim, Celso C. Ribeiro
    A Hybrid Bin-Packing Heuristic to Multiprocessor Scheduling. [Citation Graph (0, 0)][DBLP]
    WEA, 2004, pp:1-13 [Conf]
  2. Edoardo Amaldi, Leo Liberti, Nelson Maculan, Francesco Maffioli
    Efficient Edge-Swapping Heuristics for Finding Minimum Fundamental Cycle Bases. [Citation Graph (0, 0)][DBLP]
    WEA, 2004, pp:14-29 [Conf]
  3. Roberto Aringhieri
    Solving Chance-Constrained Programs Combining Tabu Search and Simulation. [Citation Graph (0, 0)][DBLP]
    WEA, 2004, pp:30-41 [Conf]
  4. Pedro J. Ballester, Jonathan N. Carter
    An Algorithm to Identify Clusters of Solutions in Multimodal Optimisation. [Citation Graph (0, 0)][DBLP]
    WEA, 2004, pp:42-56 [Conf]
  5. Paul Bartodziej, Ulrich Derigs
    On an Experimental Algorithm for Revenue Management for Cargo Airlines. [Citation Graph (0, 0)][DBLP]
    WEA, 2004, pp:57-71 [Conf]
  6. Matthieu Basseur, Julien Lemesre, Clarisse Dhaenens, El-Ghazali Talbi
    Cooperation between Branch and Bound and Evolutionary Approaches to Solve a Bi-objective Flow Shop Problem. [Citation Graph (0, 0)][DBLP]
    WEA, 2004, pp:72-86 [Conf]
  7. Hans L. Bodlaender, Celina M. Herrera de Figueiredo, Marisa Gutierrez, Ton Kloks, Rolf Niedermeier
    Simple Max-Cut for Split-Indifference Graphs and Graphs with Few P4's. [Citation Graph (0, 0)][DBLP]
    WEA, 2004, pp:87-99 [Conf]
  8. Maria C. Boeres, Celso C. Ribeiro, Isabelle Bloch
    A Randomized Heuristic for Scene Recognition by Graph Matching. [Citation Graph (0, 0)][DBLP]
    WEA, 2004, pp:100-113 [Conf]
  9. Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan
    An Efficient Implementation of a Joint Generation Algorithm. [Citation Graph (0, 0)][DBLP]
    WEA, 2004, pp:114-128 [Conf]
  10. John M. Boyer, Cristina G. Fernandes, Alexandre Noma, José Coelho de Pina
    Lempel, Even, and Cederbaum Planarity Method. [Citation Graph (0, 0)][DBLP]
    WEA, 2004, pp:129-144 [Conf]
  11. Evandro C. Bracht, Luis A. A. Meira, Flavio Keidi Miyazawa
    A Greedy Approximation Algorithm for the Uniform Labeling Problem Analyzed by a Primal-Dual Technique. [Citation Graph (0, 0)][DBLP]
    WEA, 2004, pp:145-158 [Conf]
  12. Ioannis Chatzigiannakis, Michael Markou, Sotiris E. Nikoletseas
    Distributed Circle Formation for Anonymous Oblivious Robots. [Citation Graph (0, 0)][DBLP]
    WEA, 2004, pp:159-174 [Conf]
  13. Glauber Cintra, Yoshiko Wakabayashi
    Dynamic Programming and Column Generation Based Approaches for Two-Dimensional Guillotine Cutting Problems. [Citation Graph (0, 0)][DBLP]
    WEA, 2004, pp:175-190 [Conf]
  14. Camil Demetrescu, Giuseppe F. Italiano
    Engineering Shortest Path Algorithms. [Citation Graph (0, 0)][DBLP]
    WEA, 2004, pp:191-198 [Conf]
  15. Tassos Dimitriou, Paul G. Spirakis
    How to Tell a Good Neighborhood from a Bad One: Satisfiability of Boolean Formulas. [Citation Graph (0, 0)][DBLP]
    WEA, 2004, pp:199-212 [Conf]
  16. Jingde Du, Stavros G. Kolliopoulos
    Implementing Approximation Algorithms for the Single-Source Unsplittable Flow Problem. [Citation Graph (0, 0)][DBLP]
    WEA, 2004, pp:213-227 [Conf]
  17. Amalia Duch, Conrado Martínez
    Fingered Multidimensional Search Trees. [Citation Graph (0, 0)][DBLP]
    WEA, 2004, pp:228-242 [Conf]
  18. Celina M. Herrera de Figueiredo, Guilherme Dias da Fonseca, Vinícius G. P. de Sá, Jeremy Spinrad
    Faster Deterministic and Randomized Algorithms on the Homogeneous Set Sandwich Problem. [Citation Graph (0, 0)][DBLP]
    WEA, 2004, pp:243-252 [Conf]
  19. Erik J. Hanashiro, Henrique Mongelli, Siang W. Song
    Efficient Implementation of the BSP/CGM Parallel Vertex Cover FPT Algorithm. [Citation Graph (0, 0)][DBLP]
    WEA, 2004, pp:253-268 [Conf]
  20. Martin Holzer, Frank Schulz, Thomas Willhalm
    Combining Speed-Up Techniques for Shortest-Path Computations. [Citation Graph (0, 0)][DBLP]
    WEA, 2004, pp:269-284 [Conf]
  21. Heikki Hyyrö, Kimmo Fredriksson, Gonzalo Navarro
    Increased Bit-Parallelism for Approximate String Matching. [Citation Graph (0, 0)][DBLP]
    WEA, 2004, pp:285-298 [Conf]
  22. Richard M. Karp
    The Role of Experimental Algorithms in Genomics. [Citation Graph (0, 0)][DBLP]
    WEA, 2004, pp:299-300 [Conf]
  23. Dong Kyue Kim, Junha Jo, Heejin Park
    A Fast Algorithm for Constructing Suffix Arrays for Fixed-Size Alphabets. [Citation Graph (0, 0)][DBLP]
    WEA, 2004, pp:301-314 [Conf]
  24. Corinne Lucet, Florence Mendes, Aziz Moukrim
    Pre-processing and Linear-Decomposition Algorithm to Solve the k-Colorability Problem. [Citation Graph (0, 0)][DBLP]
    WEA, 2004, pp:315-325 [Conf]
  25. Conrado Martínez, Xavier Molinero
    An Experimental Study of Unranking Algorithms. [Citation Graph (0, 0)][DBLP]
    WEA, 2004, pp:326-340 [Conf]
  26. Carlos A. Martinhon, Fábio Protti
    An Improved Derandomized Approximation Algorithm for the Max-Controlled Set Problem. [Citation Graph (0, 0)][DBLP]
    WEA, 2004, pp:341-355 [Conf]
  27. Carlos A. S. Oliveira, Panos M. Pardalos, Mauricio G. C. Resende
    GRASP with Path-Relinking for the Quadratic Assignment Problem. [Citation Graph (0, 0)][DBLP]
    WEA, 2004, pp:356-368 [Conf]
  28. Francisco Javier Ovalle-Martínez, Ivan Stojmenovic, Fabian Garcia Nocetti, Julio Solano-González
    Finding Minimum Transmission Radii for Preserving Connectivity and Constructing Minimal Spanning Trees in Ad Hoc and Sensor Networks. [Citation Graph (0, 0)][DBLP]
    WEA, 2004, pp:369-382 [Conf]
  29. David J. Pearce, Paul H. J. Kelly
    A Dynamic Algorithm for Topologically Sorting Directed Acyclic Graphs. [Citation Graph (0, 0)][DBLP]
    WEA, 2004, pp:383-398 [Conf]
  30. Sriram V. Pemmaraju, Sriram Penumatcha, Rajiv Raman
    Approximating Interval Coloring and Max-Coloring in Chordal Graphs. [Citation Graph (0, 0)][DBLP]
    WEA, 2004, pp:399-416 [Conf]
  31. Joaquín Pérez, Rodolfo A. Pazos, Juan Frausto Solís, Guillermo Rodríguez, David Romero, Laura Cruz
    A Statistical Approach for Algorithm Selection. [Citation Graph (0, 0)][DBLP]
    WEA, 2004, pp:417-431 [Conf]
  32. Vinhthuy T. Phan, Steven Skiena
    An Improved Time-Sensitive Metaheuristic Framework for Combinatorial Optimization. [Citation Graph (0, 0)][DBLP]
    WEA, 2004, pp:432-445 [Conf]
  33. Paulo E. D. Pinto, Fábio Protti, Jayme Luiz Szwarcfiter
    A Huffman-Based Error Detecting Code. [Citation Graph (0, 0)][DBLP]
    WEA, 2004, pp:446-457 [Conf]
  34. Andréa C. dos Santos, Abilio Lucena, Celso C. Ribeiro
    Solving Diameter Constrained Minimum Spanning Tree Problems in Dense Graphs. [Citation Graph (0, 0)][DBLP]
    WEA, 2004, pp:458-467 [Conf]
  35. Haroldo G. Santos, Luiz S. Ochi, Marcone J. F. Souza
    An Efficient Tabu Search Heuristic for the School Timetabling Problem. [Citation Graph (0, 0)][DBLP]
    WEA, 2004, pp:468-481 [Conf]
  36. Daniel Sawitzki
    Experimental Studies of Symbolic Shortest-Path Algorithms. [Citation Graph (0, 0)][DBLP]
    WEA, 2004, pp:482-497 [Conf]
  37. Geiza C. Silva, Luiz S. Ochi, Simone L. Martins
    Experimental Comparison of Greedy Randomized Adaptive Search Procedures for the Maximum Diversity Problem. [Citation Graph (0, 0)][DBLP]
    WEA, 2004, pp:498-512 [Conf]
  38. Ranjan Sinha
    Using Compact Tries for Cache-Efficient Sorting of Integers. [Citation Graph (0, 0)][DBLP]
    WEA, 2004, pp:513-528 [Conf]
  39. Ranjan Sinha, Justin Zobel
    Using Random Sampling to Build Approximate Tries for Efficient String Sorting. [Citation Graph (0, 0)][DBLP]
    WEA, 2004, pp:529-544 [Conf]
  40. Cid C. de Souza, André M. Lima, Nahri Moreano, Guido Araujo
    The Datapath Merging Problem in Reconfigurable Systems: Lower Bounds and Heuristic Evaluation. [Citation Graph (0, 0)][DBLP]
    WEA, 2004, pp:545-558 [Conf]
  41. Claude Tadonki, José D. P. Rolim
    An Analytical Model for Energy Minimization. [Citation Graph (0, 0)][DBLP]
    WEA, 2004, pp:559-569 [Conf]
  42. Alexandre Tarassov, Nikola S. Nikolov, Jürgen Branke
    A Heuristic for Minimum-Width Graph Layering with Consideration of Dummy Nodes. [Citation Graph (0, 0)][DBLP]
    WEA, 2004, pp:570-583 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002