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 TypeIs Full-Text AvailableSubjectCountry Of PublicationPublisherSourceTarget AudienceDonorLanguagePlace of PublicationContributorsLocation
Done
Filters
Reset
263,009
result(s) for
"Computer science Research."
Sort by:
Computing tomorrow : future research directions in computer science
by
Wand, I. C. (Ian C.), 1941-
,
Milner, R. (Robin), 1934-
in
Computer science.
,
Computer science Research Forecasting.
2009
The book's purpose is to show that long-term research in computer science is crucial and that it must not be driven solely by commercial considerations. The authors don't shirk difficult aspects of their topics, but try to expose them in the simplest terms possible, in order that the reader can understand the issues involved.
USB Complete
Now in its fifth edition, bridges the gap between the technical specifications and the real world of designing and programming devices that connect over the Universal Serial Bus (USB). Readers will learn how to select the appropriate USB speed, device cla
On Computing
by
Rosenbloom, Paul S
in
Computer Science
,
Computer science -- Philosophy
,
Computer science -- Research
2012,2013,2019
Computing isn't simply about hardware or software, or calculation or applications. Computing, writes Paul Rosenbloom, is an exciting and diverse, yet remarkably coherent, scientific enterprise that is highly multidisciplinary yet maintains a unique core of its own. In On Computing , Rosenbloom proposes that computing is a great scientific domain on a par with the physical, life, and social sciences. Rosenbloom introduces a relational approach for understanding computing, conceptualizing it in terms of forms of interaction and implementation , to reveal the hidden structures and connections among its disciplines. He argues for the continuing vitality of computing, surveying the leading edge in computing's combination with other domains, from biocomputing and brain-computer interfaces to crowdsourcing and virtual humans to robots and the intermingling of the real and the virtual. He explores forms of higher order coherence, or macrostructures, over complex computing topics and organizations, such as computing's role in the pursuit of science and the structure of academic computing. Finally, he examines the very notion of a great scientific domain in philosophical terms, honing his argument that computing should be considered the fourth great scientific domain. Rosenbloom's proposal may prove to be controversial, but the intent is to initiate a long overdue conversation about the nature and future of a field in search of its soul. Rosenbloom, a key architect of the founding of University of Southern California's Institute for Creative Technologies and former Deputy Director of USC's Information Sciences Institute, offers a broader perspective on what computing is and what it can become.
Metaphor-based metaheuristics, a call for action: the elephant in the room
2022
Taking inspiration from natural behaviors to devise new optimization algorithms has played an important role in the history of the field of metaheuristics (Sörensen et al. 2017). Unfortunately, in the last two decades we have been witnessing a new trend by which dozens of metaphor-based metaheuristics based on the most diverse possible set of natural, artificial, social, and sometimes even supernatural phenomena and behaviors are proposed, without a clear motivation beyond the desire of their authors to publish their papers.
Journal Article
Unified Polynomial Dynamic Programming Algorithms for P-Center Variants in a 2D Pareto Front
by
Nicolas Dupin
,
Frank Nielsen
,
El-Ghazali Talbi
in
[INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC]
,
[INFO.INFO-CG] Computer Science [cs]/Computational Geometry [cs.CG]
,
[INFO.INFO-RO] Computer Science [cs]/Operations Research [math.OC]
2021
With many efficient solutions for a multi-objective optimization problem, this paper aims to cluster the Pareto Front in a given number of clusters K and to detect isolated points. K-center problems and variants are investigated with a unified formulation considering the discrete and continuous versions, partial K-center problems, and their min-sum-K-radii variants. In dimension three (or upper), this induces NP-hard complexities. In the planar case, common optimality property is proven: non-nested optimal solutions exist. This induces a common dynamic programming algorithm running in polynomial time. Specific improvements hold for some variants, such as K-center problems and min-sum K-radii on a line. When applied to N points and allowing to uncover M
Journal Article
This website uses cookies to ensure you get the best experience on our website.