Browsing by Subject "Theorem proving"

Now showing items 21-30 of 30

    • Conference Object  

      Optimization of stochastic uncertain systems with variational norm constraints 

      Rezaei, F.; Charalambous, Charalambos D.; Ahmed, N. U. (2007)
      This paper considers optimization of stochastic uncertain systems on general abstract spaces, when the uncertainty of the system is described by a variational norm constraint. The pay-off is defined as a linear functional ...
    • Conference Object  

      Optimization of Stochastic Uncertain Systems: Large Deviations and Robustness 

      Charalambous, Charalambos D.; Rezaei, F. (2003)
      This paper is concerned with an abstract formulation of stochastic uncertain control systems, in which the pay-off is described by the relative entropy between the nominal measure and the uncertain measure, while the ...
    • Conference Object  

      The price of selfish routing 

      Mavronicolas, Marios; Spirakis, Paul G. (2001)
      The problem of routing in congested communication networks was studied. A noncooperative network consisting of a set of m parallel links within a game theoretic framework was considered for analysis. A collection of n ...
    • Article  

      Probabilistic detection of FSM single state-transition faults based on state occupancy measurements 

      Hadjicostis, Christoforos N. (2005)
      This note discusses a probabilistic methodology for detecting single permanent or transient functional changes in the state-transition mechanism of a deterministic finite-state machine (FSM). The associated probabilistic ...
    • Article  

      A simple graph-theoretic model for selfish restricted scheduling 

      Elsässer, R.; Gairing, M.; Lücking, T.; Mavronicolas, Marios; Monien, Burkhard (2005)
      In this work, we introduce and study a simple, graph-theoretic model for selfish scheduling among m non-cooperative users over a collection of n machines
    • Article  

      Solution of the planar Newtonian stick-slip problem with the singular function boundary integral method 

      Elliotis, Miltiades C.; Georgiou, Georgios C.; Xenophontos, Christos A. (2005)
      A singular function boundary integral method (SFBIM) is proposed for solving biharmonic problems with boundary singularities. The method is applied to the Newtonian stick-slip flow problem. The streamfunction is approximated ...
    • Conference Object  

      Stable theories for logic programs 

      Kakas, Antonis C.; Mancarella, P. (Publ by MIT Press, 1991)
      We define a class of theories associated to any normal logic program, called stable theories, based on a notion of stable negative hypotheses. This stability of hypotheses is motivated directly from the intuitive understanding ...
    • Conference Object  

      Strength of counting networks 

      Busch, Costas; Mavronicolas, Marios (1996)
      This paper shows that any counting network, made up of balancers whose fan-in and fan-out vary arbitrarily, is, indeed, strong enough to simultaneously support both Fetch&Increment and Fetch&Decrement operations, once each ...
    • Article  

      Subsampling the distribution of diverging statistics with applications to finance 

      Bertail, Patrice; Haefke, C.; Politis, Dimitris Nicolas; White, H. (2004)
      In this paper we propose a subsampling estimator for the distribution of statistics diverging at either known or unknown rates when the underlying time series is strictly stationary and strong mixing. Based on our results ...
    • Conference Object  

      TDM- vs. FDM- based data-item scheduling in wireless broadcast systems with user retrials 

      Vlajic, N.; Charalambous, Charalambos D.; Makrakis, D. (2003)
      In the previous research works on wireless data broadcast, time-division-multiplex (TDM) based data-item scheduling has been exclusively studied, while no mention or clear evidence against frequency-division-multiplex, ...