Catalogue Search | MBRL
Search Results Heading
Explore the vast range of titles available.
MBRLSearchResults
-
DisciplineDiscipline
-
Is Peer ReviewedIs Peer Reviewed
-
Series TitleSeries Title
-
Reading LevelReading Level
-
YearFrom:-To:
-
More FiltersMore FiltersContent TypeItem TypeDegree TypeIs Full-Text AvailableSubjectCountry Of PublicationPublisherSourceGranting InstitutionTarget AudienceDonorLanguagePlace of PublicationContributorsLocation
Done
Filters
Reset
522,652
result(s) for
"Programming"
Sort by:
How to talk to your computer
by
Simon, Seymour, author
,
Lowery, Mike, 1980- illustrator
in
Microcomputers Programming Juvenile literature.
,
Computer programming Juvenile literature.
,
Microcomputers Programming.
2019
Introduces young children to computer languages and explains programs and how to write them.
Hands-On Functional Programming in Rust
2018,2024
Functional programming allows developers to divide programs into smaller, reusable components that ease the creation and maintenance of software as a whole. Combining power of Rust, you can develop robust applications that fulfill modern day software requirements. This book will help you discover Rust features to build software in a functional way.
Kotlin programming by example
by
Adelekan, Iyanu
in
Android (Electronic resource)
,
Application Development
,
Application software -- Development
2018,2024
Kotlin greatly reduces the verbosity of source code. With Google having announced their support for Kotlin as a first-class language for writing Android apps, now's the time learn how to create apps from scratch with Kotlin. Kotlin Programming By Example takes you through the building blocks of Kotlin, such as functions and classes. You’ll explore various features of Kotlin by building three applications of varying complexity. For a quick start to Android development, we look at building a classic game, Tetris, and elaborate on object-oriented programming in Kotlin. Our next application will be a messenger app, a level up in terms of complexity. Before moving onto the third app, we take a look at data persistent methods, helping us learn about the storage and retrieval of useful applications. Our final app is a place reviewer: a web application that will make use of the Google Maps API and Place Picker. By the end of this book, you will have gained experience of of creating and deploying Android applications using Kotlin.
Bad programming practices 101 : become a better coder by learning how (not) to program
\"This book takes a humorous slant on the programming practice manual by reversing the usual approach: under the pretence of teaching you how to become the world's worst programmer who generally causes chaos, the book teaches you how to avoid the kind of bad habits that introduce bugs or cause code contributions to be rejected. Why be a code monkey when you can be a chaos monkey? OK, so you want to become a terrible programmer. You want to write code that gets vigorously rejected in review. You look forward to reading feedback plastered in comments like WTF?? Even better, you fantasize about your bug-ridden changes sneaking through and causing untold chaos in the codebase. You want to build a reputation as someone who writes creaky, messy, error-prone garbage that frustrates your colleagues. Bad Programming Practices 101 will help you achieve that goal a whole lot quicker by teaching you an array of bad habits that will allow you to cause maximum chaos.Alternatively, you could use this book to identify those bad habits and learn to avoid them. The bad practices are organized into topics that form the basis of programming (layout, variables, loops, modules, and so on). It's been remarked that to become a good programmer, you must first write 10,000 lines of bad code to get it all out of your system. This book is aimed at programmers who have so far written only a small portion of that. By learning about poor programming habits, you will learn good practices. In addition, you will find out the motivation behind each practice, so you can learn why it is considered good and not simply get a list of rules.\"-- Provided by publisher.
Solving Stochastic and Bilevel Mixed-Integer Programs via a Generalized Value Function
by
Tavaslıoǧlu, Onur
,
Prokopyev, Oleg A.
,
Schaefer, Andrew J.
in
Algorithms
,
bilevel programming
,
global branch and bound
2019
We introduce a generalized value function of a mixed-integer program, which is simultaneously parameterized by its objective and right-hand side. We describe its fundamental properties, which we exploit through three algorithms to calculate it. We then show how this generalized value function can be used to reformulate two classes of mixed-integer optimization problems: two-stage stochastic mixed-integer programming and multifollower bilevel mixed-integer programming. For both of these problem classes, the generalized value function approach allows the solution of instances that are significantly larger than those solved in the literature in terms of the total number of variables and number of scenarios.
Journal Article
Beginning Server-Side Application Development with Angular
by
Borggreve, Bram
in
Angular JS (Software framework)
,
COMPUTERS / Programming / General
,
JavaScript (Computer program language)
2018,2024
Dynamic client-side web applications are great for UX, but not so much for your SEO. Learn how to build the same great UX with server-side Angular, all without taking a hit to search referrals.
The Rust programming language
\"The official guide to Rust, a community-developed, systems programming language. Begins with a hands-on project to introduce the basics, then explores key concepts in depth\"-- Provided by publisher.
How to convexify the intersection of a second order cone and a nonconvex quadratic
by
Burer, Samuel
,
Kılınç-Karzan, Fatma
in
Calculus of Variations and Optimal Control; Optimization
,
Combinatorics
,
Conics
2017
A recent series of papers has examined the extension of disjunctive-programming techniques to mixed-integer second-order-cone programming. For example, it has been shown—by several authors using different techniques—that the convex hull of the intersection of an ellipsoid,
E
, and a split disjunction,
(
l
-
x
j
)
(
x
j
-
u
)
≤
0
with
l
<
u
, equals the intersection of
E
with an additional second-order-cone representable (SOCr) set. In this paper, we study more general intersections of the form
K
∩
Q
and
K
∩
Q
∩
H
, where
K
is a SOCr cone,
Q
is a nonconvex cone defined by a single homogeneous quadratic, and
H
is an affine hyperplane. Under several easy-to-verify conditions, we derive simple, computable convex relaxations
K
∩
S
and
K
∩
S
∩
H
, where
S
is a SOCr cone. Under further conditions, we prove that these two sets capture precisely the corresponding conic/convex hulls. Our approach unifies and extends previous results, and we illustrate its applicability and generality with many examples.
Journal Article