Results 11 to 20 of about 920,111 (198)

Progressor: Personalized visual access to programming problems [PDF]

, 2011
This paper presents Progressor, a visualization of open student models intended to increase the student's motivation to progress on educational content. The system visualizes not only the user's own model, but also the peers' models.
Bakalov, F, Brusilovsky, P, Hsiao, IH, König-Ries, B   +3 more
core   +1 more source

Integer programming methods for special college admissions problems [PDF]

, 2014
We develop Integer Programming (IP) solutions for some special college admission problems arising from the Hungarian higher education admission scheme. We focus on four special features, namely the solution concept of stable score-limits, the presence of
A Kwanashie, AE Roth, AE Roth, AE Roth, D Gale, DF Manlove, E Ronn, EJ McDermid, J Sethuraman, M Baïou, MU Ünver, P Biró, P Biró, P Biró, RW Irving, RW Irving, T Fleiner, T Fleiner, UG Rothblum, Y Kamada   +19 more
core   +2 more sources

Learning to solve planning problems efficiently by means of genetic programming [PDF]

, 2001
Declarative problem solving, such as planning, poses interesting challenges for Genetic Programming (GP). There have been recent attempts to apply GP to planning that fit two approaches: (a) using GP to search in plan space or (b) to evolve a planner. In
Aler, Ricardo, Borrajo Millán, Daniel, Isasi, Pedro   +2 more
core   +5 more sources

Solving stable matching problems using answer set programming [PDF]

, 2015
Since the introduction of the stable marriage problem (SMP) by Gale and Shapley (1962), several variants and extensions have been investigated. While this variety is useful to widen the application potential, each variant requires a new algorithm for ...
De Clercq, Sofie, De Cock, Martine, Nowé, Ann, Schockaert, Steven   +3 more
core   +2 more sources

Towards an optimised VLSI design algorithm for the constant matrix multiplication problem [PDF]

, 2006
The efficient design of multiplierless implementations of constant matrix multipliers is challenged by the huge solution search spaces even for small scale problems.
Kinane, Andrew, Muresan, Valentin, O'Connor, Noel E.   +2 more
core   +1 more source

Dynamic programming for graphs on surfaces [PDF]

, 2010
We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs on n vertices and branchwidth at most k.
B. Courcelle, B. Mohar, E.D. Demaine, E.D. Demaine, F. Dorn, F. Dorn, F. Dorn, F. Flajolet, F.V. Fomin, H.L. Bodlaender, J.A. Telle, N. Robertson, P. Flajolet, P. Seymour, S. Arnborg, S. Cabello   +15 more
core   +1 more source

Modeling Stable Matching Problems with Answer Set Programming [PDF]

, 2013
The Stable Marriage Problem (SMP) is a well-known matching problem first introduced and solved by Gale and Shapley (1962). Several variants and extensions to this problem have since been investigated to cover a wider set of applications.
A. Kato, A. Roth, C. Baral, D. Gale, D. Gale, D. Gusfield, D. Manlove, E. Erdem, G. Brewka, P. Dung, R. Irving, R. Irving, R. Irving, T. Eiter, V. Marek   +14 more
core   +3 more sources

Fast interior point solution of quadratic programming problems arising from PDE-constrained optimization [PDF]

, 2017
Interior point methods provide an attractive class of approaches for solving linear, quadratic and nonlinear programming problems, due to their excellent efficiency and wide applicability.
A Borzì, A Borzì, A Borzì, A Drǎgǎnescu, A Napov, A Schiela, AJ Wathen, AJ Wathen, B Li, CC Paige, CT Kelley, F Tröltzsch, GH Golub, GH Golub, HC Elman, HD Mittelmann, ICF Ipsen, IS Duff, J Gondzio, J Gondzio, J Pestana, Jacek Gondzio, John W. Pearson, JW Pearson, JW Pearson, JW Pearson, L Bergamaschi, M Benzi, M Benzi, M Bergounioux, M Hinze, M Porcelli, M Ulbrich, M Weiser, M Weiser, M Weiser, MF Murphy, MJ Gander, MJ Grotte, R Herzog, SJ Wright, T Rusten, Y Notay, Y Notay, Y Saad, YA Kuznetsov   +45 more
core   +2 more sources

Developments in linear and integer programming [PDF]

, 2002
In this review we describe recent developments in linear and integer (linear) programming. For over 50 years Operational Research practitioners have made use of linear optimisation models to aid decision making and over this period the size of problems ...
Darby-Dowman, K, Wilson, J M
core   +1 more source

Universal Electronic‐Structure Relationship Governing Intrinsic Magnetic Properties in Permanent Magnets

Advanced Functional Materials, EarlyView.
Permanent magnets derive their extraordinary strength from deep, universal electronic‐structure principles that control magnetization, anisotropy, and intrinsic performance. This work uncovers those governing rules, examines modern modeling and AI‐driven discovery methods, identifies critical bottlenecks, and reveals electronic fingerprints shared ...
Prashant Singh
wiley   +1 more source