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
130
result(s) for
"Computer algorithms -- Congresses"
Sort by:
Algorithms and data structures : 9th international workshop, WADS 2005, Waterloo, Canada, August 15-17, 2005 : proceedings
by
WADS 2005 (2005 : Waterloo, Ont.)
,
Dehne, F. (Frank), 1960- editor
,
López-Ortiz, Alejandro editor
in
Data structures (Computer science) Congresses
,
Computer algorithms Congresses
2005
Computational Aspects of Discrete Subgroups of Lie Groups
by
Detinko, Alla
,
Kapovich, Michael
,
Kontorovich, Alex
in
Computer algorithms-Congresses
,
Group theory-Congresses
,
Lie groups-Congresses
2023
This volume contains the proceedings of the virtual workshop on Computational Aspects of Discrete Subgroups of Lie Groups, held from June 14 to June 18, 2021, and hosted by the Institute for Computational and Experimental Research in Mathematics (ICERM), Providence, Rhode Island.The major theme deals with a novel domain of computational algebra: the design, implementation, and application of algorithms based on matrix representation of groups and their geometric properties. It is centered on computing with discrete subgroups of Lie groups, which impacts many different areas of mathematics such as algebra, geometry, topology, and number theory. The workshop aimed to synergize independent strands in the area of computing with discrete subgroups of Lie groups, to facilitate solution of theoretical problems by means of recent advances in computational algebra.
Approximation, randomization, and combinatorial optimization : algorithms and techniques : 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003, and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeton, NJ, USA, August 24-26, 2003 : proceedings
by
International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (6th : 2003 : Princeton, N.J.)
,
Jansen, Klaus editor
,
Sahai, Amit editor
in
Computer science Statistical methods Congresses.
,
Computer algorithms Congresses.
2003
Computational aspects of discrete subgroups of Lie groups : Virtual Conference Computational Aspects of Discrete Subgroups of Lie Groups, June 14-18, 2021, Institute for Computational and Experimental Research in Mathematics (ICERM), Providence, Rhode Island
by
Virtual Conference on Computational Aspects of Discrete Subgroups of Lie Groups
,
Kapovich, Michael
,
Schwartz, Richard Evan
in
Computer algorithms
,
Computer algorithms -- Congresses
,
Computer science -- Algorithms -- Symbolic computation and algebraic computation msc
2023
This volume contains the proceedings of the virtual workshop on Computational Aspects of Discrete Subgroups of Lie Groups, held from June 14 to June 18, 2021, and hosted by the Institute for Computational and Experimental Research in Mathematics (ICERM), Providence, Rhode Island.The major theme deals with a novel domain of computational algebra: the design, implementation, and application of algorithms based on matrix representation of groups and their geometric properties. It is centered on computing with discrete subgroups of Lie groups, which impacts many different areas of mathematics such as algebra, geometry, topology, and number theory. The workshop aimed to synergize independent strands in the area of computing with discrete subgroups of Lie groups, to facilitate solution of theoretical problems by means of recent advances in computational algebra.
Graphs and algorithms : proceedings of the AMS-IMS-SIAM Joint Summer Research Conference held June 28-July 4, 1987 with support from the National Science Foundation
by
Richter, R. Bruce
,
AMS-IMS-SIAM Joint Summer Research Conference in the Mathematical Sciences on Graphs and Algorithms
,
American Mathematical Society
in
Algorithms -- Congresses
,
Computer algorithms
,
Graph theory
1989
This volume contains the proceedings of the AMS-IMS-SIAM Joint Summer Research Conference on Graphs and Algorithms, held in 1987 at the University of Colorado in Boulder. The purpose of the conference was to foster communication between computer scientists and mathematicians, for recent work in graph theory and related algorithms has relied on increasingly sophisticated mathematics. Wagner's Conjecture, self-adjusting data structures, graph isomorphism, and various embedding and labelling problems in VLSI are examples of the kinds of questions now facing the field. With around 65 participants, the conference brought out the depth and diversity of current research in this area. The wide range of topics covered in this volume demonstrates the vitality of the activity in both mathematics and computer science and captures the diversity and excitement of the conference.
Distributed algorithms on graphs : proceedings of the 1st International Workshop on Distributed Algorithms, Ottawa, Canada, August 1985
by
International Workshop on Distributed Algorithms
,
Gafni, Eli
,
Santoro, Nicola
in
Algorithms -- Congresses
,
Electronic data processing -- Distributed processing -- Congresses
1986
Progress in new materials and mechanics research : selected, peer reviewed papers from the 2012 International Conference on Computer-Aided Material and Engineering 2012 (ICCME 2012), March 17-18, 2012, Hangzhou, China
by
International Conference on Computer-Aided Material and Engineering
,
Deng, Xiancang
,
Dong, Xufeng
2012
Mining massive data sets for security : advances in data mining, search, social networks and text mining, and their applications to security
by
Piskorski, Jakub
,
NATO Advanced Study Institute on Mining Massive Data Sets for Security
,
Perrotta, Domenico
in
Computer algorithms
,
Congresses
,
Data mining
2008
The real power for security applications will come from the synergy of academic and commercial research focusing on the specific issue of security. Special constraints apply to this domain, which are not always taken into consideration by academic research, but are critical for successful security applications: large volumes: techniques must be able to handle huge amounts of data and perform 'on-line' computation; scalability: algorithms must have processing times that scale well with ever growing volumes; automation: the analysis process must be automated so that information extraction can 'run on its own'; ease of use: everyday citizens should be able to extract and assess the necessary information; and robustness: systems must be able to cope with data of poor quality (missing or erroneous data). The NATO Advanced Study Institute (ASI) on Mining Massive Data Sets for Security, held in Italy, September 2007, brought together around ninety participants to discuss these issues. This publication includes the most important contributions, but can of course not entirely reflect the lively interactions which allowed the participants to exchange their views and share their experience. The bridge between academic methods and industrial constraints is systematically discussed throughout. This volume will thus serve as a reference book for anyone interested in understanding the techniques for handling very large data sets and how to apply them in conjunction for solving security issues.
Handbook of satisfiability
by
Heule, Marijn
,
Maaren, Hans van
,
Biere, Armin
in
Algebra, Boolean
,
Algebra, Boolean -- Congresses
,
Computer algorithms
2009
\"Satisfiability (SAT) related topics have attracted researchers from various disciplines: logic, applied areas such as planning, scheduling, operations research and combinatorial optimization, but also theoretical issues on the theme of complexity and much more, they all are connected through SAT. My personal interest in SAT stems from actual solving: The increase in power of modern SAT solvers over the past 15 years has been phenomenal. It has become the key enabling technology in automated verification of both computer hardware and software. Bounded Model Checking (BMC) of computer hardware is now probably the most widely used model checking technique. The counterexamples that it finds are just satisfying instances of a Boolean formula obtained by unwinding to some fixed depth a sequential circuit and its specification in linear temporal logic. Extending model checking to software verification is a much more difficult problem on the frontier of current research. One promising approach for languages like C with finite word-length integers is to use the same idea as in BMC but with a decision procedure for the theory of bit-vectors instead of SAT. All decision procedures for bit-vectors that I am familiar with ultimately make use of a fast SAT solver to handle complex formulas. Decision procedures for more complicated theories, like linear real and integer arithmetic, are also used in program verification. Most of them use powerful SAT solvers in an essential way. Clearly, efficient SAT solving is a key technology for 21st century computer science. I expect this collection of papers on all theoretical and practical aspects of SAT solving will be extremely useful to both students and researchers and will lead to many further advances in the field.\"--Edmund Clarke (FORE Systems University Professor of Computer Science and Professor of Electrical
and Computer Engineering at Carnegie Mellon University, winner of the 2007 A.M. Turing Award).
Families Apart
by
Pratt, Geraldine
in
Computer algorithms -- Congresses
,
Computer programming -- Congresses
,
Graph theory -- Congresses
2012
In a developing nation like the Philippines, many mothers provide for their families by traveling to a foreign country to care for someone else's. Families Apart focuses on Filipino overseas workers in Canada to reveal what such arrangements mean for families on both sides of the global divide. The outcome of Geraldine Pratt's collaboration with the Philippine Women Centre of British Columbia, this study documents the difficulties of family separation and the problems that children have when they reunite with their mothers in Vancouver. Aimed at those who have lived this experience, those who directly benefit from it, and those who simply stand by and watch, Families Apart shows how Filipino migrant domestic workers-often mothers themselves-are caught between competing neoliberal policies of sending and receiving countries and how, rather than paying rich returns, their ambitions as migrants often result in social and economic exclusion for themselves and for their children. This argument takes shape as an open-ended series of encounters, moving between a singular academic voice and the \"we\" of various research collaborations, between Vancouver and the Philippines, and between genres of \"evidence-based\" social scientific research, personal testimony, theatrical performance, and nonfictional narrative writing. Through these experiments with different modes of storytelling, Pratt seeks to transform frameworks of perception, to create and collect sympathetic witnesses-in short, to promote a wide-ranging public discussion and debate about a massive worldwide shift in family (and nonfamily) relations of intimacy and care.
Publication