, Ashok Agarwal
, A. Bishop
, Andre Charbonneau
, Ronald J. Desmarais
, K. Fransham
, N. Hill
, Ian Gable
, S. Gaudet
, S. Goliath
, Roger Impey
, C. Leavett-Brown
, J. Ouellete
, Michael Paterson
, C. Pritchet
, D. Penfold-Brown
, Wayne Podaima
, D. Schade
, Randall J. Sobie
: Cloud Scheduler: a resource manager for distributed compute clouds.
Mubashir Husain Rehmani
: Channel Assortment Strategy for Reliable Communication in Multi-Hop Cognitive Radio Networks.
: From matrix interpretations over the rationals to matrix interpretations over the naturals.
Neal E. Young
: A Bound on the Sum of Weighted Pairwise Distances of Points Constrained to Balls.
: Autonomic Management in a Distributed Storage System.
: Approximate Counting for Complex-Weighted Boolean Constraint Satisfaction Problems.
: Impact Of Mobility and Transmission Range On The Performance of Backoff Algorithms For IEEE 802.11-Based Multi-hop Mobile Ad hoc Networks.
, Matthew R. McKay
: Perturbed Hankel Determinants: Applications to the Information Theory of MIMO Wireless Communications.
: An Improved Neighbourhood for the Traveling Tournament Problem.
: Femto-Macro Cellular Interference Control with Subband Scheduling and Interference Cancelation.
: Simulation-Checking of Real-Time Systems with Fairness Assumptions.
G. C. Pentzaropoulos
: Limits of responsiveness concerning human-readable knowledge bases: an operational analysis.
: Quickest Time Detection with Phase-Type Change Distribution and Social Learning.
: Symmetry within and between solutions.
, Huazhong Yang
: Transmission Line Inspires A New Distributed Algorithm to Solve the Nonlinear Dynamical System of Physical Circuit.
: Is Computational Complexity a Barrier to Manipulation?
, Ming Li
, Lei Guo
: Soft Control on Collective Behavior of a Group of Autonomous Agents by a Shill Agent.
: Comparison of PBO solvers in a dependency solving domain. 23-31
: Inflection system of a language as a complex network.
: Submodularity on a tree: Unifying $L^\natural$-convex and bisubmodular functions.
: Efficient Sketches for the Set Query Problem.
: A note on sample complexity of learning binary output neural networks under fixed input distributions.