Filters








19 Hits in 2.0 sec

List of contents

2000 Applied Mathematics Letters  
Equations 121 Two Crucial Examples Related to Properness of Weakly Relaxed Delayed Controls 129 Oscillation of Second-Order Linear Difference Equations NUMBER 2 1 9 17 New Linear Codes Over  ...  Second-Order Boundary Value Problem "Virus" in Several Discrete Oscillation Theorems An Existence Theorem for a Class of Inclusions Quasi-Equilibrium Problems with Applications to Infinite Optimization  ... 
doi:10.1016/s0893-9659(00)80001-4 fatcat:rzb6sovgknexxi3nxdbfgfom4u

Stochastic Resource Allocation for Energy-Constrained Systems

DanielGrobe Sachs, DouglasL Jones
2009 EURASIP Journal on Wireless Communications and Networking  
We show that use of Lagrangian optimization provides a fast, elegant, and, for convex problems, optimal solution to the allocation of energy across applications as they enter and leave the system, even  ...  As our framework requires only a stochastic description of future workloads, and not a full schedule, we also significantly expand the scope of systems that can be optimized.  ...  multichoice knapsack described by Moser [2] .  ... 
doi:10.1155/2009/246439 fatcat:mkn3ftcvojaihfsliuc5tkrqka

Combining optimizations in automated low power design

Qiang Liu, Tim Todman, Wayne Luk
2010 2010 Design, Automation & Test in Europe Conference & Exhibition (DATE 2010)  
missed by separating the optimizations.  ...  Moreover, for a given execution time, our combined approach generates designs using up to 1.4 times less power than those produced by the same optimizations applied separately and can also find solutions  ...  In [3] code transformations from floating-point to fixedpoint and polynomial approximation of arithmetic operations are automated to optimise system power consumption in an embedded system.  ... 
doi:10.1109/date.2010.5457104 dblp:conf/date/LiuTL10 fatcat:wsriwopv2fcejlz3lh4zz7qrde

Optimization over Degree Sequences [article]

Antoine Deza, Asaf Levin, Syed M. Meesum, Shmuel Onn
2018 arXiv   pre-print
This implies that optimization over hypergraphs is hard already for simple concave functions.  ...  We introduce and study the problem of optimizing arbitrary functions over degree sequences of hypergraphs and multihypergraphs.  ...  Finally, a study of approximation algorithms for this and the closely related separable multichoice optimization framework over monotone systems was very recently taken in [14] .  ... 
arXiv:1706.03951v2 fatcat:4ikerk5xcbcglooeh5gm5qgsdu

2004 Transportation Science and Logistics Section Dissertation Prize Competition

Lawrence Snyder, Miguel Figliozzi, Jeffrey Michael Casello, Elaine J. Chang, Chi-Nan Chin, Frank Crittin, Laurie Garrow, Paulo Goncalves, Dennis Huisman, Wenlong Jin, Laura Sumi Kang, Zongzhi Li (+4 others)
2005 Transportation Science  
Finally, a system optimization model, along with a solution algorithm using Lagrangian relaxation techniques, was formulated on the basis of the multichoice multidimensional knapsack problem to facilitate  ...  Our approach offers significant advan-tages over both the traditionally considered user equilibrium and the system optimum.  ... 
doi:10.1287/trsc.1050.0128 fatcat:nldutg74tfc6tcajcebksoeeje

Monotone decomposition of 2-additive Generalized Additive Independence models

Michel Grabisch, Christophe Labreuche
2018 Mathematical Social Sciences  
We consider a significant subclass of GAI models, namely the discrete 2-additive GAI models, and provide for this class a decomposition into nonnegative monotone terms.  ...  This decomposition allows a reduction from exponential to quadratic complexity in any optimization problem involving discrete 2-additive models, making them usable in practice.  ...  It is characterized by a condition stating that if two probability distributions P and Q over the alternatives X have the same marginals over every S ∈ S, then the expected utility of P and Q are equal  ... 
doi:10.1016/j.mathsocsci.2017.09.007 fatcat:hm757tnsljcyxk6mqwgywbniue

On the decomposition of Generalized Additive Independence models [article]

Michel Grabisch, Christophe Labreuche
2016 arXiv   pre-print
We consider a significant subclass of GAI models, namely the discrete 2-additive GAI models, and provide for this class a decomposition into nonnegative monotone terms.  ...  This decomposition allows a reduction from exponential to quadratic complexity in any optimization problem involving discrete 2-additive models, making them usable in practice.  ...  The number of monotonicity conditions highly influences the efficiency of the optimization algorithm. This shows again the importance of Theorem 2.  ... 
arXiv:1601.05978v1 fatcat:2ker7vu33bc33ezsf5i2xfizzu

Effectiveness, efficiency, engagement: Mapping the impact of pre-lecture quizzes on educational exchange

Tanya Evans, Barbara Kensington-Miller, Julia Novak
2021 Australasian Journal of Educational Technology  
Our study addresses a systemic issue facing higher education – a lack of rigorous educational research alongside new technology-assisted ways of teaching and learning.  ...  Over the last decade, as technology has become an integral part of higher education, technology-assisted teaching and learning are no longer regarded as separate or even new phenomena.  ...  The field of educational technology focuses on students, teachers and systems, such that: These three components are often hard to disentangle, which has sometimes resulted in research over-claiming the  ... 
doi:10.14742/ajet.6258 fatcat:afhw7ji2ureibe3aum3bvnklbq

Solving fuzzy Multidimensional Multiple-Choice Knapsack Problems: The multi-start Partial Bound Enumeration method versus the efficient epsilon-constraint method

Kaveh Khalili-Damghani, Majid Nojavan, Madjid Tavana
2013 Applied Soft Computing  
The proposed multi-start PBE method can also be customized for other multi-objective mathematical programming problems with monotone objective functions.  ...  We also retrieved the non-dominated solutions for each procedure separately and the regenerated Pareto front for each algorithm was achieved. Fig. 4 plots the Pareto fronts of each method.  ... 
doi:10.1016/j.asoc.2013.01.014 fatcat:gfzz542n2fgibccqye7bq64ca4

Cognitive cost as dynamic allocation of energetic resources

S. Thomas Christie, Paul Schrater
2015 Frontiers in Neuroscience  
distinct ways the brain might control its metabolic output, and show how a control-theoretic model that models decision-making with an energy budget can explain cognitive effort avoidance in terms of an optimal  ...  Plots show results from Simulation 1, separated by agent lookahead and intrinsic cost (see also Figure 5 ). (A) Computed optimal control u over time.  ...  Given a system with intrinsic dynamics, a controller repeatedly receives signals from the system, estimates its state, and executes actions in order to optimize an objective function over time.  ... 
doi:10.3389/fnins.2015.00289 pmid:26379482 pmcid:PMC4547044 fatcat:3hk44pw3infx5m7ykcqsdnuaf4

Selected Topics in Cooperative Game Theory [chapter]

Julia Drechsel
2010 Lecture notes in economics and mathematical systems  
Obviously, due to c.f2; 3g/ < c.f3g/, the game is not monotone. Assume D .0; 2; 9/, player 3 would prefer the game .f2; 3g; c/ over the game .N; c/.  ...  They determine the bounds via aggregating over the columns of the LP.  ... 
doi:10.1007/978-3-642-13725-9_2 fatcat:nomnjbqt5nhulmhjcv762575jm

Content-based search of model repositories with graph matching techniques

Bojana Bislimovska, Alessandro Bozzon, Marco Brambilla, Piero Fraternali
2011 Proceeding of the 3rd international workshop on Search-driven development: users, infrastructure, tools, and evaluation - SUITE '11  
The proposed approach matches approximate queries over databases of graphs, where the query is also a graph which may contain don't care symbols (match any attribute value in a corresponding position),  ...  TALE (Tool for Approximate Subgraph Matching of Large Queries Efficiently) is a general tool for approximate subgraph matching of large graph queries discussed in [58] .  ... 
doi:10.1145/1985429.1985431 fatcat:7ssdhdbbs5baro7pvbyuc4763e

Problems using ordinal traits with continuous measures of functional diversity [article]

Matt Davis
2021 bioRxiv   pre-print
used, were not based on objective criteria (Petchey et al. 2009) , overestimated redundancy by lumping together heterogeneous species (Fonseca and Ganade 2001) , and often provided no predictive power over  ...  Gower defined the similarity sijk individually for continuous, nominal, and binary variables (Gower 1971) , with later authors defining extensions for ordinal variables (Podani 1999) ; multichoice nominal  ... 
doi:10.1101/2021.11.02.466687 fatcat:6uj3ulvn35cs3j65grtp5n64jm

Localist representation can improve efficiency for detection and counting

Horace Barlow, Anthony Gardner-Medwin
2000 Behavioral and Brain Sciences  
There are still some problems inherent in the application of fully distributed systems and some inadequacies in proposed solutions to these problems.  ...  Over the last decade, fully distributed models have become dominant in connectionist psychological modelling, whereas the virtues of localist models have been underestimated.  ...  To the system, the entities or dimensions are separable (cf. Cheng & Pachella 1984) .  ... 
doi:10.1017/s0140525x00223352 fatcat:zeo65fd76vh4nblxjvlahq3vgm

Connectionist modelling in psychology: A localist manifesto

Mike Page
2000 Behavioral and Brain Sciences  
There are still some problems inherent in the application of fully distributed systems and some inadequacies in proposed solutions to these problems.  ...  Over the last decade, fully distributed models have become dominant in connectionist psychological modelling, whereas the virtues of localist models have been underestimated.  ...  To the system, the entities or dimensions are separable (cf. Cheng & Pachella 1984) .  ... 
doi:10.1017/s0140525x00003356 fatcat:6hnhqgbdtvcbtggl75dafiwlsi
« Previous Showing results 1 — 15 out of 19 results