Results 51 to 60 of about 149,618 (314)
Complexity analysis of primal-dual algorithms for the semidefinite linear complementarity problem
Journal of Numerical Analysis and Approximation Theory, 2011 In this paper a primal-dual path-following interior-point algorithm for the monotone semidefinite linear complementarity problem is presented. The algorithm is based on Nesterov-Todd search directions and on a suitable proximity for tracing approximately the central-path.
Mohamed Achache, Naima Boudiaf
openaire +3 more sources
Intelligent Tutoring Systems for Adult Learning in STEM Disciplines
New Directions for Adult and Continuing Education, EarlyView.ABSTRACT Intelligent tutoring systems (ITS) are reshaping adult learning in STEM by providing adaptive, data‐driven instruction across classrooms, workplaces, and informal environments. In the context of ITS, this article compares generative AI, which creates personalized explanations and practice materials, with explainable AI, which focuses on ...
Jill Zarestky, Amanda R. Lager Gleason
wiley +1 more source
Efficient algorithms for generalized Stable Marriage and Roommates problems [PDF]
, 2007 We consider a generalization of the Stable Roommates problem (SR), in which preference lists may be partially ordered and forbidden pairs may be present, denoted by SRPF.
Irving, R.W. +5 more
core +1 more source
Revisiting Online Algorithms: A Survey of Set Cover Solutions Beyond Competitive Analysis
IEEE AccessOnline algorithms are crucial for real-time decision-making and adaptability across diverse fields, such as operations research, computer science, and combinatorics. These algorithms handle data incrementally and make decisions without prior knowledge of
Christine Markarian +2 more
doaj +1 more source
Path Coverage Algorithm Based on Minimization of Sensor Movement Distance [PDF]
Jisuanji gongcheng, 2018 Most of existing algorithms for path coverage do not consider minimization of sensors movement distance.Aiming at this situation,this paper proves that the above mentioned problem is NP-hard,and presents a heuristic path covering algorithm.It moves ...
CHEN Xi,LIU Zhixiong
doaj +1 more source
IEEE Access, 2021 This paper addresses the problem of decoding non-binary low density parity check codes(LDPC) over finite field $GF(q)$ using symbol flipping approach.
Waheed Ullah +2 more
doaj +1 more source
Statistical physics analysis of the computational complexity of solving random satisfiability problems using backtrack algorithms [PDF]
The European Physical Journal B, 2001 The computational complexity of solving random 3-Satisfiability (3-SAT) problems is investigated using statistical physics concepts and techniques related to phase transitions, growth processes and (real-space) renormalization flows. 3-SAT is a representative example of hard computational tasks; it consists in knowing whether a set of αN randomly drawn
S. Cocco, R. Monasson
openaire +1 more source
New Directions for Adult and Continuing Education, EarlyView.ABSTRACT Mental well‐being is central to adult learner success, yet many adult education institutions lack capacity to provide timely and accessible support. This article examines how artificial intelligence (AI) can strengthen mental health–adjacent supports in adult and continuing higher education, with attention to professional practice and ...
Adam L. McClain, Thomas Wade
wiley +1 more source
A low-cost neural sorting network with O(1) time complexity [PDF]
, 2011 [[abstract]]In this paper, we present an O(1) time neural network with O(n1 + var epsilon) neurons and links to sort n data, var epsilon > 0. For large-size problems, it is desirable to have low-cost hardware solutions.
Lin, Shun-Shii;Hsu, Shen-Hsuan
core
On the Use of Biased-Randomized Algorithms for Solving Non-Smooth Optimization Problems [PDF]
, 2019 Soft constraints are quite common in real-life applications. For example, in freight transportation, the fleet size can be enlarged by outsourcing part of the distribution service and some deliveries to customers can be postponed as well; in inventory ...
Albert Ferrer +4 more
core +1 more source