Novel search space splitting techniques have recently been successfully exploited to paralleliz Constraint Programming and Mixed Integer Programming solvers. We first show how universal hashing can be used to extend one such interesting approach to a generalized setting that goes beyond discrepancy-based search, while still retaining strong theoretical guarantees. We then explain that such stat...

Sensor networks will be usually used for the collection of measured data. In many cases, a tree structure is formed for data query, data dissemination and other operations. As sensor nodes fail, this underlying tree structure is impacted or, at the worst case, disabled. In this paper, we propose and compare three algorithms to restore the tree structure for sensor network under network dynamics...

We introduce a new cryptographic primitive: Proofs of SpaceTime (PoSTs) and construct a practical protocol for implementing these proofs. A PoST allows a prover to convince a verifier that she spent a “spacetime” resource (storing data—space—over a period of time). Formally, we define the PoST resource as a linear tradeoff between CPU work and space-time (under reasonable cost assumptions, a ra...

Solving constraint optimization problems is hard because it is not enough to find the best solution; an algorithm does not know a candidate is the best solution until it has proven that there are no better solutions. The proof can be long, compared to the time spent to find a good solution. In the cases where there are resource bounds, the proof of optimality may not be achievable and a tradeof...

We propose a new in-sample cross validation based method (randomized GACV) for choosing smoothing or bandwidth parameters that govern the bias-variance or fit-complexity tradeoff in 'soft' classification. Soft classification refers to a learning procedure which estimates the probability that an example with a given attribute vector is in class 1 vs class O. The target for optimizing the the tra...

1 Abstract— In this paper, we examine, through direct experimentation, the tradeoff between design quality and performance, in terms of optimized design area, and the design time required to achieve this desired level of optimization. It is accepted that the costs associated with executing a VLSI design project must be managed. This includes finding an appropriate (and profitable) balance betwe...

One of the fundamental tradeoffs underlying society is that between efficiency and equality. The challenge for institutional design is to strike the right balance between these two goals. Game-theoretic models of public-goods provision under ‘meritocratic’ matching succinctly capture this tradeoff: under zero meritocracy (society is randomly formed), theory predicts maximal inefficiency but per...

Location Area(LA) planning has critical impact on cellular network design. It is characterized by the tradeoff between the location updates overhead and the paging cost. The LA size could be made as large as the service area of main switching centre, and hence minimizing the registration overhead at the expense of maximizing the paging cost. On the other hand, if each cell is taken as an LA, th...

Wireless local area networks still suffer from a severe performance discrepancy between different users in the uplink. This is because of the spatially varying channel conditions provided by the wireless medium. Cooperative medium access control (MAC) protocols as for example CoopMAC were proposed to mitigate this problem. In this work, it is shown that node cooperation implies a tradeoff betwe...