Browsing by Subject "Problem solving"
Now showing items 21-40 of 159
-
Article
Boundary value problems for quasilinear ODEs
(2005)A priori bounds for the quasilinear ordinary differential equations (ODE), are discussed. A priori bounds for the derivative of the solution of one-dimensional p-Laplacian are proved. The global solvability of quasilinear ...
-
Conference Object
Capacity of gaussian channels with noise uncertainty
(2004)In this paper the problem of defining, and computing the capacity of a communication channel when the statistic of an additive noise is not fully known, is addressed. The communication channel is specified as a continuous ...
-
Article
Classes of nonlinear partially observable stochastic optimal control problems with explicit optimal control laws
(1998)This paper introduces certain nonlinear partially observable stochastic optimal control problems which are equivalent to completely observable control problems with finite-dimensional state space. In some cases the optimal ...
-
Article
Classical methods in nonmonotonic reasoning
(1994)In this paper we present and compare some classical problem solving methods for computing the stable models of a general propositional logic program. In particular linear programming, propositional satisfiability, constraint ...
-
Article
A combinatorial characterization of properties preserved by antitokens
(2000)Balancing networks are highly distributed data structures used to solve multiprocessor synchronization problems. Typically, balancing networks are accessed by tokens, and the distribution of the tokens on the network’s ...
-
Article
A combinatorial treatment of balancing networks
(1996)Balancing networks, originally introduced by Aspnes et al. (Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, pp. 348-358, May 1991), represent a new class of distributed, low-contention data structures ...
-
Article
Computational assessment of distributed decomposition methods for stochastic linear programs
(1998)Incorporating uncertainty in optimization models gives rise to large, structured mathematical programs. Decomposition procedures are well-suited for parallelization, thus providing a promising venue for solving large ...
-
Conference Object
Computing Nash equilibria for scheduling on restricted parallel links
(2004)We consider the problem of routing n users on m parallel links, under the restriction that each user may only be routed on a link from a certain set of allowed links for the user. Thus, the problem is equivalent to the ...
-
Doctoral Thesis Open Access
Conceptual and representational understanding related to the concept of function: a comparative study between Cyprus and Italy
(Πανεπιστήμιο Κύπρου, Σχολή Κοινωνικών Επιστημών και Επιστημών Αγωγής / University of Cyprus, Faculty of Social Sciences and Education, 2010-12)Η έννοια της συνάρτησης είναι πολύ σημαντική στα μαθηματικά και τις εφαρμογές τους (Eisenberg, 1992). Η κατανόηση της έννοιας αυτής είναι ένα θέμα που συγκεντρώνει την προσοχή των εκπαιδευτικών αλλά και της μαθηματικής ...
-
Conference Object
Context management and its applications to distributed transactions
(IEEE, 1996)An emerging paradigm that handles multiple locii of control in a system allows multiple program threads to work on the same task, each thread to work on a different task, or a thread to work on multiple tasks for greater ...
-
Conference Object
Control of discrete-time partially-observed jump linear systems over causal communication systems
(2006)We consider the problem of control of discrete-time partially-observed jump linear system over a noisy causal communication channel. Necessary conditions for observability and stabilizability in probability and r-th mean ...
-
Article
Converged solutions of the Newtonian extrudate-swell problem
(1999)Both the axisymmetric and the planar Newtonian extrudate-swell problems are solved using the standard and the singular finite element methods. In the latter method, special elements that incorporate the radial form of the ...
-
Conference Object
A convex programming approach to the multiobjective H2/H∞ problem
(2002)In this paper, Banach space duality theory for the multiobjective H2/H∞ problem developed recently by the authors, is used to develop algorithms to solve this problem by approximately reducing the dual and predual ...
-
Article
A deductive approach to the solution of the problem of optimal pairs trading from the viewpoint of stochastic control with time-dependent parameters
(2015)In a fairly recent paper (2008 American Control Conference, June 11-13, 1035-1039), the problem of dealing with trading in optimal pairs was treated from the viewpoint of stochastic control. The analysis of the subsequent ...
-
Conference Object
Design space navigation for neighboring power-performance efficient microprocessor configurations
(2005)Microprocessor design is a considerably complex task. First, microprocessors include many resources that may be configured in different ways. This leads to a time consuming multi-objective optimization problem. Second, ...
-
Conference Object Open Access
Designing problem-solving and laboratory content for a web-based distance education course in introductory general physics
(University of Zilina, 2005)There is a strong prejudice among physicists, and specialists in other mathematically intensive disciplines, that effective distance education is not feasible in their subject because of the impossibility of teaching ...
-
Conference Object
Designing stable inverters and state observers for switched linear systems with unknown inputs
(2006)We present a method for estimating the inputs and states in discrete-time switched linear systems with unknown inputs. We first investigate the problem of system invertibility, which reconstructs the unknown inputs based ...
-
Conference Object Open Access
Developing students' problem solving skills by learning simulation "hiking across Estonia"
(Department of Educational Sciences, University of Cyprus, 2003)A unique web-based learning environment “Hiking Across Estonia” (http://bio.edu.ee/tour/) comprising two modules – one for students and another for developers and researchers – has been composed. Students have to solve 30 ...
-
Article
Direct methods for spectral approximations in nonconforming domain decompositions
(1998)The application of a conforming spectral collocation method to certain nonconforming domain decompositions leads to global matrices which have a particular block structure. We study the performance of various direct linear ...
-
Article
Direct routing: Algorithms and complexity
(2004)Direct routing is the special case of bufferless routing where N packets, once injected into the network, must be routed along specific paths to their destinations without conflicts. We give a general treatment of three ...