The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Sotiris E. Nikoletseas
    Algorithms for Wireless Sensor Networks: Design, Analysis and Experimental Evaluation. [Citation Graph (0, 0)][DBLP]
    WEA, 2006, pp:1-12 [Conf]
  2. Matthieu Bouget, Pierre Leone, José D. P. Rolim
    Numerical Estimation of the Impact of Interferences on the Localization Problem in Sensor Networks. [Citation Graph (0, 0)][DBLP]
    WEA, 2006, pp:13-23 [Conf]
  3. Thayse Christine S. Dias, Gilberto F. de Sousa Filho, Elder M. Macambira, Lucidio dos Anjos F. Cabral, Marcia Helena Costa Fampa
    An Efficient Heuristic for the Ring Star Problem. [Citation Graph (0, 0)][DBLP]
    WEA, 2006, pp:24-35 [Conf]
  4. Jeff Hartline, Alexa Sharp
    An Incremental Model for Combinatorial Maximization Problems. [Citation Graph (0, 0)][DBLP]
    WEA, 2006, pp:36-48 [Conf]
  5. Siamak Tazari, Matthias Müller-Hannemann, Karsten Weihe
    Workload Balancing in Multi-stage Production Processes. [Citation Graph (0, 0)][DBLP]
    WEA, 2006, pp:49-60 [Conf]
  6. Marcin Gomulkiewicz, Miroslaw Kutylowski, Pawel Wlaz
    Fault Cryptanalysis and the Shrinking Generator. [Citation Graph (0, 0)][DBLP]
    WEA, 2006, pp:61-72 [Conf]
  7. Josep Freixas, Xavier Molinero
    Some Advances in the Theory of Voting Systems Based on Experimental Algorithms. [Citation Graph (0, 0)][DBLP]
    WEA, 2006, pp:73-84 [Conf]
  8. Rodrigo Paredes, Edgar Chávez, Karina Figueroa, Gonzalo Navarro
    Practical Construction of k-Nearest Neighbor Graphs in Metric Spaces. [Citation Graph (0, 0)][DBLP]
    WEA, 2006, pp:85-97 [Conf]
  9. Krists Boitmanis, Karlis Freivalds, Peteris Ledins, Rudolfs Opmanis
    Fast and Simple Approximation of the Diameter and Radius of a Graph. [Citation Graph (0, 0)][DBLP]
    WEA, 2006, pp:98-108 [Conf]
  10. Abdelrahman Amer, B. John Oommen
    Lists on Lists: A Framework for Self-organizing Lists in Environments with Locality of Reference. [Citation Graph (0, 0)][DBLP]
    WEA, 2006, pp:109-120 [Conf]
  11. Leonor Frias, Jordi Petit, Salvador Roura
    Lists Revisited: Cache Conscious STL Lists. [Citation Graph (0, 0)][DBLP]
    WEA, 2006, pp:121-133 [Conf]
  12. O'Neil Delpratt, Naila Rahman, Rajeev Raman
    Engineering the LOUDS Succinct Tree Representation. [Citation Graph (0, 0)][DBLP]
    WEA, 2006, pp:134-145 [Conf]
  13. Jérémy Barbay, Alejandro López-Ortiz, Tyler Lu
    Faster Adaptive Set Intersections for Text Searching. [Citation Graph (0, 0)][DBLP]
    WEA, 2006, pp:146-157 [Conf]
  14. Ankur Gupta, Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter
    Compressed Dictionaries: Space Measures, Data Sets, and Experiments. [Citation Graph (0, 0)][DBLP]
    WEA, 2006, pp:158-169 [Conf]
  15. Kimmo Fredriksson, Szymon Grabowski
    Efficient Bit-Parallel Algorithms for (delta, alpha)-Matching. [Citation Graph (0, 0)][DBLP]
    WEA, 2006, pp:170-181 [Conf]
  16. Jon Louis Bentley
    Tiny Experiments for Algorithms and Life. [Citation Graph (0, 0)][DBLP]
    WEA, 2006, pp:182-182 [Conf]
  17. Matthias Englert, Heiko Röglin, Matthias Westermann
    Evaluation of Online Strategies for Reordering Buffers. [Citation Graph (0, 0)][DBLP]
    WEA, 2006, pp:183-194 [Conf]
  18. Burkhard Monien, Andreas Woclaw
    Scheduling Unrelated Parallel Machines Computational Results. [Citation Graph (0, 0)][DBLP]
    WEA, 2006, pp:195-206 [Conf]
  19. Mihhail Aizatulin, Florian Diedrich, Klaus Jansen
    Implementation of Approximation Algorithms for the Max-Min Resource Sharing Problem. [Citation Graph (0, 0)][DBLP]
    WEA, 2006, pp:207-218 [Conf]
  20. Lorenza Moreno, Marcus Poggi de Aragão, Eduardo Uchoa
    Column Generation Based Heuristic for a Helicopter Routing Problem. [Citation Graph (0, 0)][DBLP]
    WEA, 2006, pp:219-230 [Conf]
  21. Josep Díaz, Jordi Petit, Dimitrios M. Thilikos
    Kernels for the Vertex Cover Problem on the Preferred Attachment Model. [Citation Graph (0, 0)][DBLP]
    WEA, 2006, pp:231-240 [Conf]
  22. Tobias Polzin, Siavash Vahdati Daneshmand
    Practical Partitioning-Based Methods for the Steiner Problem. [Citation Graph (0, 0)][DBLP]
    WEA, 2006, pp:241-252 [Conf]
  23. Bhaskar DasGupta, German A. Enciso, Eduardo D. Sontag, Yi Zhang
    Algorithmic and Complexity Results for Decompositions of Biological Networks into Monotone Subsystems. [Citation Graph (0, 0)][DBLP]
    WEA, 2006, pp:253-264 [Conf]
  24. Refael Hassin, Einat Or
    A Maximum Profit Coverage Algorithm with Application to Small Molecules Cluster Identification. [Citation Graph (0, 0)][DBLP]
    WEA, 2006, pp:265-276 [Conf]
  25. Ricardo A. Baeza-Yates
    Algorithmic Challenges in Web Search Engines. [Citation Graph (0, 0)][DBLP]
    WEA, 2006, pp:277-278 [Conf]
  26. Karina Figueroa, Edgar Chávez, Gonzalo Navarro, Rodrigo Paredes
    On the Least Cost for Proximity Searching in Metric Spaces. [Citation Graph (0, 0)][DBLP]
    WEA, 2006, pp:279-290 [Conf]
  27. Gerasimos G. Pollatos, Orestis Telelis, Vassilis Zissimopoulos
    Updating Directed Minimum Cost Spanning Trees. [Citation Graph (0, 0)][DBLP]
    WEA, 2006, pp:291-302 [Conf]
  28. Markus Chimani, Carsten Gutwenger, Petra Mutzel
    Experiments on Exact Crossing Minimization Using Column Generation. [Citation Graph (0, 0)][DBLP]
    WEA, 2006, pp:303-315 [Conf]
  29. Jens Maue, Peter Sanders, Domagoj Matijevic
    Goal Directed Shortest Path Queries Using Precomputed Cluster Distances. [Citation Graph (0, 0)][DBLP]
    WEA, 2006, pp:316-327 [Conf]
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002