Problem of time

Results: 679



#Item
1Final round Dutch Mathematical Olympiad Friday 13 September 2013 Eindhoven University of Technology • Available time: 3 hours. • Each problem is worth 10 points. Points can also be awarded to partial solutions.

Final round Dutch Mathematical Olympiad Friday 13 September 2013 Eindhoven University of Technology • Available time: 3 hours. • Each problem is worth 10 points. Points can also be awarded to partial solutions.

Add to Reading List

Source URL: wiskundeolympiade.nl

Language: English - Date: 2015-04-10 06:17:57
    2Final round Dutch Mathematical Olympiad Friday 17 September 2010 Technical University Eindhoven • Available time: 3 hours. • Each problem is worth 10 points. A description of your solution method and clear argumentat

    Final round Dutch Mathematical Olympiad Friday 17 September 2010 Technical University Eindhoven • Available time: 3 hours. • Each problem is worth 10 points. A description of your solution method and clear argumentat

    Add to Reading List

    Source URL: wiskundeolympiade.nl

    Language: English - Date: 2015-04-10 06:17:57
      31 MAE280a midtermminutes, closed book, no calculators, one page of notes allowed. 1. In this problem, we consider a simple continuous-time LTI system x′ = Ax on a given interval t ∈ [0, T ]. What is the s

      1 MAE280a midtermminutes, closed book, no calculators, one page of notes allowed. 1. In this problem, we consider a simple continuous-time LTI system x′ = Ax on a given interval t ∈ [0, T ]. What is the s

      Add to Reading List

      Source URL: renaissance.ucsd.edu

      Language: English - Date: 2009-11-04 04:10:12
        4Final round Dutch Mathematical Olympiad Friday 16 September 2011 Technical University Eindhoven • Available time: 3 hours. • Each problem is worth 10 points. A description of your solution method and clear argumentat

        Final round Dutch Mathematical Olympiad Friday 16 September 2011 Technical University Eindhoven • Available time: 3 hours. • Each problem is worth 10 points. A description of your solution method and clear argumentat

        Add to Reading List

        Source URL: wiskundeolympiade.nl

        Language: English - Date: 2015-04-10 06:17:57
          5Development of Custom Board for Active Noise Cancellation Application FAST A/D GIVES 10 µs TURNAROUND TIME Problem: The implementation of active noise cancellation into deep-insertion earpieces required DSP hardware wit

          Development of Custom Board for Active Noise Cancellation Application FAST A/D GIVES 10 µs TURNAROUND TIME Problem: The implementation of active noise cancellation into deep-insertion earpieces required DSP hardware wit

          Add to Reading List

          Source URL: www.etegent.com

          Language: English - Date: 2010-06-22 14:02:17
            6Symposium on Theoretical Aspects of Computer ScienceBordeaux), ppwww.stacs-conf.org MINIMIZING FLOW TIME IN THE WIRELESS GATHERING PROBLEM VINCENZO BONIFACI 1,3 , PETER KORTEWEG 2 , ALBERTO MARCHETTI-SPA

            Symposium on Theoretical Aspects of Computer ScienceBordeaux), ppwww.stacs-conf.org MINIMIZING FLOW TIME IN THE WIRELESS GATHERING PROBLEM VINCENZO BONIFACI 1,3 , PETER KORTEWEG 2 , ALBERTO MARCHETTI-SPA

            Add to Reading List

            Source URL: drops.dagstuhl.de

            Language: English - Date: 2008-02-05 05:19:16
              7DAY 1 Intro, Overview of the Problem–Solution, Forming the Team with Exercise and Pitfalls to Avoid Time 12:30 PM EST to 5:00 PM EST Break 45 minutes between 2:30 PM EST to 3:15 PM

              DAY 1 Intro, Overview of the Problem–Solution, Forming the Team with Exercise and Pitfalls to Avoid Time 12:30 PM EST to 5:00 PM EST Break 45 minutes between 2:30 PM EST to 3:15 PM

              Add to Reading List

              Source URL: www.dobetterdeals.com

              Language: English - Date: 2018-04-12 12:23:47
                8Distributed Bregman-Distance Algorithms for Min-Max Optimization Kunal Srivastava, Angelia Nedi´c and Duˇsan Stipanovi´c Abstract We consider a min-max optimization problem over a time-varying network of computational

                Distributed Bregman-Distance Algorithms for Min-Max Optimization Kunal Srivastava, Angelia Nedi´c and Duˇsan Stipanovi´c Abstract We consider a min-max optimization problem over a time-varying network of computational

                Add to Reading List

                Source URL: www.ifp.illinois.edu

                Language: English - Date: 2012-07-08 16:00:18
                  9In this talk we will explore the different notions of a fractional-time derivative and their applications in physics. We will then focus on a specific problem and discuss existence, uniqueness, and regularity. We prove a

                  In this talk we will explore the different notions of a fractional-time derivative and their applications in physics. We will then focus on a specific problem and discuss existence, uniqueness, and regularity. We prove a

                  Add to Reading List

                  Source URL: www.math.columbia.edu

                  - Date: 2014-10-07 15:26:11
                    10Determining the number of factors: the example of the NEO-PI-R William Revelle June 25, 2007 The number of factors to extract from a data set is a long time problem in psychometrics.

                    Determining the number of factors: the example of the NEO-PI-R William Revelle June 25, 2007 The number of factors to extract from a data set is a long time problem in psychometrics.

                    Add to Reading List

                    Source URL: www.personality-project.org

                    - Date: 2007-06-25 21:30:04