scispace - formally typeset
Search or ask a question
Institution

Government of Canada

GovernmentOttawa, Ontario, Canada
About: Government of Canada is a government organization based out in Ottawa, Ontario, Canada. It is known for research contribution in the topics: Monetary policy & Productivity. The organization has 796 authors who have published 886 publications receiving 21366 citations. The organization is also known as: federal government of Canada & Her Majesty's Government.


Papers
More filters
Journal ArticleDOI
TL;DR: It is argued that for internal evaluations to be useful evaluators must take a management perspective and deliver technically adequate, timely, and politically astute evaluation products.

8 citations

Book ChapterDOI
01 Oct 2012
TL;DR: This paper presents an algorithm that solves the Dge problem under the following conditions: there are multiple black holes and black links, the network topology is unknown, the searchers are initially scattered in arbitrary locations, and the system is totally asynchronous.
Abstract: Black hole search (Bhs) is the problem of mapping or exploring a network where there are dangerous sites (black holes) that eliminate any incoming searcher without leaving a discernible trace. Dangerous graph exploration (Dge) extends the Bhs problem to include dangerous links (black links). In the literature, both problems have only been studied under the assumption that no faults occur in the network during the exploration. In this paper, we examine the impact that link failures can have on the exploration of dangerous graphs. We study the Dge problem under the following conditions: there are multiple black holes and black links, the network topology is unknown, the searchers are initially scattered in arbitrary locations, and the system is totally asynchronous. In this difficult setting, we assume that links can fail during the computation. We present an algorithm that solves the Dge in the presence of such dynamic link failures. Our solution to the problem works with an optimum number of searchers in a polynomial number of moves. This is the first result dealing with fault-tolerant computations in dangerous graphs.

8 citations

Book ChapterDOI
04 Jun 2012
TL;DR: This work proposes a solution that would allow tourists to create a map of the Paris Metro system from scratch that shows the locations of the cafes with the good coffee, while addressing the problem of the tourists losing interest in the process once they have found good coffee.
Abstract: Finding a good cup of coffee in Paris is difficult even among its world-renowned cafes, at least according to author David Downie (2011). We propose a solution that would allow tourists to create a map of the Paris Metro system from scratch that shows the locations of the cafes with the good coffee, while addressing the problem of the tourists losing interest in the process once they have found good coffee. We map the problem to the black hole search problem in the subway model introduced by Flocchini et al. at Fun with Algorithms 2010. We provide a solution that allows the tourists to start anywhere and at any time, communicate using whiteboards on the subway trains, rely on much less information than is normally available to subway passengers, and work independently but collectively to map the subway network. Our solution is the first to deal with scattered agents searching for black holes in a dynamic network and is optimal both in terms of the team size and the number of carrier moves required to complete the map.

8 citations

Posted Content
TL;DR: In this article, the authors measure the size and composition of non-tariff trade costs such as transport, wholesale, and network costs incurred in Canada's merchandise trade using Statistics Canada's latest 'trade margins' statistics.
Abstract: This paper measures the size and composition of non-tariff trade costs such as transport, wholesale, and network costs incurred in Canada's merchandise trade using Statistics Canada's latest 'trade margins' statistics. It examines how changes in these trade costs have influenced Canada's merchandise trade pattern and the course of economic integration. Our results show that as tariffs have been substantially reduced and largely abolished, costs associated with transport and distribution services now appear much larger than remaining customs duties; therefore, liberalisation in services might be the next key step in promoting greater merchandise trade. Further, reducing transport and other trade-related costs has helped 'reverse' the 'home market effect', expanding Canada's domestic demand and production for exports of differentiated products.

8 citations


Authors

Showing all 802 results

NameH-indexPapersCitations
Kingston H. G. Mills9231329630
David W. Schindler8521739792
Martha C. Anderson7034020288
Hui Li6224614395
Lei Zhang5814621872
Michael J. Vanni5512411714
Cars Hommes5425014984
Richard E. Caves5311524552
John W. M. Rudd51709446
Karen A. Kidd4716310255
Kenneth O. Hill431268842
Steven H. Ferguson432256797
Derwyn C. Johnson411038208
Kevin E. Percy40915167
Guy Ampleman401284706
Network Information
Related Institutions (5)
University of Waterloo
93.9K papers, 2.9M citations

73% related

Queen's University
78.8K papers, 2.8M citations

72% related

Virginia Tech
95.2K papers, 2.9M citations

72% related

University of Maryland, College Park
155.9K papers, 7.2M citations

72% related

Université de Montréal
100.4K papers, 4M citations

72% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
20234
20223
202147
202044
201931
201832