We consider the following fundamental scheduling problem. The input consists of n jobs to be scheduled on a set of machines of bounded capacities. Each job is associated with a re...
For an integer h 1, an elementary h-route flow is a flow along h edge disjoint paths between a source and a sink, each path carrying a unit of flow, and a single commodity h-rout...
We develop a computational method for simulating models of gel dynamics where the gel is described by two phases, a networked polymer and a fluid solvent. The models consist of tra...
Query expansion is a long-studied approach for improving retrieval effectiveness by enhancing the user's original query with additional related words. Current algorithms for ...
— Today’s Internet carries an ever broadening range of application traffic with different requirements. This has stressed its original, one-class, best-effort model, and has b...