Εμφανίζονται 41 - 60 Αποτελέσματα από 322 για την αναζήτηση 'Counting problem (complexity)', χρόνος αναζήτησης: 0,32δλ Περιορισμός αποτελεσμάτων
  1. 41
    Algorithmic Number Theory 6th International Symposium, ANTS-VI, Burlington, VT, USA, June 13-18, 2004, Proceedings /
    Έκδοση 2004
    Πίνακας περιεχομένων: “… -- Binary GCD Like Algorithms for Some Complex Quadratic Rings -- On the Complexity of Computing Units in a…”
    Full Text via HEAL-Link
    Ηλεκτρονική πηγή Ηλ. βιβλίο
  2. 42
    Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems 7th International Conference, CPAIOR 2010, Bologna, Italy, June 14-18, 2010. Proceedings /
    Έκδοση 2010
    Πίνακας περιεχομένων: “…, and Double Counting -- The Increasing Nvalue Constraint -- Improving the Held and Karp Approach…”
    Full Text via HEAL-Link
    Ηλεκτρονική πηγή Ηλ. βιβλίο
  3. 43
    Graph-Theoretic Concepts in Computer Science 42nd International Workshop, WG 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected Papers /
    Έκδοση 2016
    Πίνακας περιεχομένων: “… complexity of the MINCCA problem on graphs of bounded decomposability -- On edge intersection graphs of paths…”
    Full Text via HEAL-Link
    Ηλεκτρονική πηγή Ηλ. βιβλίο
  4. 44
    Tools and Algorithms for the Construction and Analysis of Systems 15th International Conference, TACAS 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, York, UK, March 22-29, 2009. Proceedings /
    Έκδοση 2009
    Πίνακας περιεχομένων: “… under Limited Observability -- The Complexity of Predicting Atomicity Violations -- Tools II…”
    Full Text via HEAL-Link
    Ηλεκτρονική πηγή Ηλ. βιβλίο
  5. 45
    Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques 11th International Workshop, APPROX 2008, and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 25-27, 2008. Proceedings /
    Έκδοση 2008
    Πίνακας περιεχομένων: “… and Unique-Games Hardness -- Fully Polynomial Time Approximation Schemes for Time-Cost Tradeoff Problems…”
    Full Text via HEAL-Link
    Ηλεκτρονική πηγή Ηλ. βιβλίο
  6. 46
    Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems 6th International Conference, CPAIOR 2009 Pittsburgh, PA, USA, May 27-31, 2009 Proceedings /
    Έκδοση 2009
    Πίνακας περιεχομένων: “… Problems -- Open Constraints in a Boundable World -- Sequencing and Counting with the multicost-regular…”
    Full Text via HEAL-Link
    Ηλεκτρονική πηγή Ηλ. βιβλίο
  7. 47
    Algorithmic Aspects of Wireless Sensor Networks Third International Workshop, ALGOSENSORS 2007, Wroclaw, Poland, July 14, 2007, Revised Selected Papers /
    Έκδοση 2008
    Πίνακας περιεχομένων: “… for Continuous Monitoring of Moving Objects -- Counting Targets with Mobile Sensors in an Unknown Environment…”
    Full Text via HEAL-Link
    Ηλεκτρονική πηγή Ηλ. βιβλίο
  8. 48
    Parameterized and Exact Computation Third International Workshop, IWPEC 2008, Victoria, Canada, May 14-16, 2008. Proceedings /
    Έκδοση 2008
    Πίνακας περιεχομένων: “… Degree-Constrained Subgraph Problem -- Fixed Structure Complexity -- An Improved Fixed-Parameter…”
    Full Text via HEAL-Link
    Ηλεκτρονική πηγή Ηλ. βιβλίο
  9. 49
    Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems 5th International Conference, CPAIOR 2008 Paris, France, May 20-23, 2008 Proceedings /
    Έκδοση 2008
    Πίνακας περιεχομένων: “… Approach to the Job-Shop Scheduling Problem -- Short Papers -- Counting Solutions of Integer Programs Using…”
    Full Text via HEAL-Link
    Ηλεκτρονική πηγή Ηλ. βιβλίο
  10. 50
    Fun with Algorithms 7th International Conference, FUN 2014, Lipari Island, Sicily, Italy, July 1-3, 2014. Proceedings /
    Έκδοση 2014
    Πίνακας περιεχομένων: “… Connections by Few Agents.- Counting Houses of Pareto Optimal Matchings in the House Allocation Problem…”
    Full Text via HEAL-Link
    Ηλεκτρονική πηγή Ηλ. βιβλίο
  11. 51
    Contemporary Computing Second International Conference, IC3 2009, Noida, India, August 17-19, 2009. Proceedings /
    Έκδοση 2009
    Πίνακας περιεχομένων: “… -- Technical Session-4: Algorithm-4 (AL-4) -- On the Connectivity, Lifetime and Hop Count of Routes Determined…”
    Full Text via HEAL-Link
    Ηλεκτρονική πηγή Ηλ. βιβλίο
  12. 52
    Algorithmic Number Theory 8th International Symposium, ANTS-VIII Banff, Canada, May 17-22, 2008 Proceedings /
    Έκδοση 2008
    Πίνακας περιεχομένων: “… Discriminant -- Point Counting -- Computing Hilbert Class Polynomials -- Computing Zeta Functions in Families…”
    Full Text via HEAL-Link
    Ηλεκτρονική πηγή Ηλ. βιβλίο
  13. 53
    Algorithms and Computation 24th International Symposium, ISAAC 2013, Hong Kong, China, December 16-18, 2013, Proceedings /
    Έκδοση 2013
    Πίνακας περιεχομένων: “…: Computational Complexity III -- Model Counting for Formulas of Bounded Clique- Width -- Computing Plurality…”
    Full Text via HEAL-Link
    Ηλεκτρονική πηγή Ηλ. βιβλίο
  14. 54
    Graph Theoretic Concepts in Computer Science 36th International Workshop, WG 2010, Zarós, Crete, Greece, June 28-30, 2010 Revised Papers /
    Έκδοση 2010
    Πίνακας περιεχομένων: “… and Bidimensionality -- Regular Talks -- Complexity Results for the Spanning Tree Congestion Problem -- max-cut…”
    Full Text via HEAL-Link
    Ηλεκτρονική πηγή Ηλ. βιβλίο
  15. 55
    Computing and Combinatorics 15th Annual International Conference, COCOON 2009 Niagara Falls, NY, USA, July 13-15, 2009 Proceedings /
    Έκδοση 2009
    Πίνακας περιεχομένων: “… -- Classification of a Class of Counting Problems Using Holographic Reductions -- Separating NE from Some Nonuniform…”
    Full Text via HEAL-Link
    Ηλεκτρονική πηγή Ηλ. βιβλίο
  16. 56
    Algorithms for Computational Biology Third International Conference, AlCoB 2016, Trujillo, Spain, June 21-22, 2016, Proceedings /
    Έκδοση 2016
    Πίνακας περιεχομένων: “… Network -- Counting, Generating and Sampling Tree Alignments -- A New Multi-Objective Approach…”
    Full Text via HEAL-Link
    Ηλεκτρονική πηγή Ηλ. βιβλίο
  17. 57
    Arithmetic of Finite Fields 2nd International Workshop, WAIFI 2008 Siena, Italy, July 6-9, 2008 Proceedings /
    Έκδοση 2008
    Πίνακας περιεχομένων: “… Sums -- Transitive q-Ary Functions over Finite Fields or Finite Sets: Counts, Properties…”
    Full Text via HEAL-Link
    Ηλεκτρονική πηγή Ηλ. βιβλίο
  18. 58
    Algorithms and Data Structures 9th International Workshop, WADS 2005, Waterloo, Canada, August 15-17, 2005. Proceedings /
    Έκδοση 2005
    Πίνακας περιεχομένων: “… -- Parameterized Complexity of Generalized Vertex Cover Problems -- The Complexity of Implicit and Space Efficient…”
    Full Text via HEAL-Link
    Ηλεκτρονική πηγή Ηλ. βιβλίο
  19. 59
    Automated Deduction – CADE-24 24th International Conference on Automated Deduction, Lake Placid, NY, USA, June 9-14, 2013. Proceedings /
    Έκδοση 2013
    Πίνακας περιεχομένων: “… Logic -- Analysing Vote Counting Algorithms via Logic: And Its Application to the CADE Election Scheme…”
    Full Text via HEAL-Link
    Ηλεκτρονική πηγή Ηλ. βιβλίο
  20. 60
    Distributed Computing 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007. Proceedings /
    Έκδοση 2007
    Πίνακας περιεχομένων: “… Counting in Mobile Sensor Networks with a Base Station -- Scalable Load-Distance Balancing -- Time Optimal…”
    Full Text via HEAL-Link
    Ηλεκτρονική πηγή Ηλ. βιβλίο
Εργαλεία αναζήτησης: Λήψη RSS – Αποστολή αναζήτησης με email