In this paper, it is shown that all programmes of all television channels can be modelled as an interval graph. The programme slots are taken as the vertices of the graph and if the time duration of two programme slots have non-empty intersection, the corresponding vertices are considered to be connected by an edge. The number of viewers of a programme is taken as the weight of the vertex. A se...

Doodle is a simple and popular online system for scheduling events. It is an implementation of the approval voting mechanism, where candidates are the time slots and each responder approves a subset of the slots. We analyze all the Doodle polls created in the US from JulySeptember 2011 (over 340,000 polls), consisting of both hidden polls (where you cannot see other people’s votes) and open pol...

We present a simple model of a debate between two interested parties which takes into account the complexity of their policy positions. The two debaters engage in all-pay-auctions to win slots of time/attention to present their positions to a decision maker. Complexity of a policy is modelled through the number of slots of attention needed to get the policy across. We show that when the number ...

In wireless ad hoc and sensor networks, an analysis of the node energy consumption distribution shows that the largest part is due to the time spent in the idle state. This result is at the origin of SERENA, an algorithm to SchEdule RoutEr Nodes Activity. SERENA allows router nodes to sleep, while ensuring end-to-end communication in the wireless network. It is a localized and decentralized alg...

Much recent research has aimed to establish whether visual working memory (WM) is better characterized by a limited number of discrete all-or-none slots or by a continuous sharing of memory resources. To date, however, researchers have not considered the response-time (RT) predictions of discrete-slots versus shared-resources models. To complement the past research in this field, we formalize a...

Space-Time Division Multiple Access (patent pending) is the first position-based TDMA scheduling protocol for mobile ad-hoc networks, and is the generalization of the cellular TDMA with spatial re-use bandwidth allocation paradigm that is encountered in cellular TDMA networks. In STDMA, space is divided into virtual geographic cells (space slots) that are grouped into periodically repeating vir...

Efficiently modeling thin features using the finite-difference time-domain (FDTD) method involves a considerable reduction in spatial mesh size. However, real-world scenarios, such reductions can lead to unaffordable memory and CPU requirements. In this manuscript, we present two stable efficient techniques FDTD handle narrow apertures on conductive panels. One technique employs conformal metho...

We present a resource-aware scheduling technique for MapReduce multi-job workloads that aims at improving resource utilization across machines while observing completion time goals. Existing MapReduce schedulers define a static number of slots to represent the capacity of a cluster, creating a fixed number of execution slots per machine. This abstraction works for homogeneous workloads, but fai...

We study a problem appearing at the end of a logistic stream in a warehouse and which concerns the timetabling of sorting slots necessary to accomodate the prepared orders before being dispatched. We consider a set of orders to be prepared on some preparation shops over a given time horizon. Each order is associated with the truck handling its transportation to its customer. A sorting slot is a...