Sciweavers

727 search results - page 78 / 146
» A Calculus of Bounded Capacities
Sort
View
INFOCOM
2007
IEEE
14 years 2 months ago
Optimal-Complexity Optical Router
—In the past years, electronic routers have had trouble keeping up with the increase in optical fiber capacity. As their power consumption has grown exponentially and already ex...
Hadas Kogan, Isaac Keslassy
AIPS
2004
13 years 9 months ago
Iterative Relaxations for Iterative Flattening in Cumulative Scheduling
Cumulative scheduling is a generalization of jobshop scheduling, where machines have discrete capacities and activities may require several capacity units. This paper considers it...
Laurent Michel, Pascal Van Hentenryck
SIAMDM
2010
113views more  SIAMDM 2010»
13 years 2 months ago
The VPN Problem with Concave Costs
We consider the following network design problem. We are given an undirected network with costs on the edges, a set of terminals, and an upper bound for each terminal limiting the ...
Samuel Fiorini, Gianpaolo Oriolo, Laura Sanit&agra...
CORR
2008
Springer
116views Education» more  CORR 2008»
13 years 7 months ago
Binding bigraphs as symmetric monoidal closed theories
Milner's bigraphs [1] are a general framework for reasoning about distributed and concurrent programming languages. Notably, it has been designed to encompass both the -calcul...
Tom Hirschowitz, Aurélien Pardon
MKM
2009
Springer
14 years 2 months ago
Unifying Math Ontologies: A Tale of Two Standards
Abstract. One of the fundamental and seemingly simple aims of mathematical knowledge management (MKM) is to develop and standardize formats that allow to “represent the meaning o...
James H. Davenport, Michael Kohlhase