Sciweavers

93 search results - page 17 / 19
» Constraint Programming Models for Graceful Graphs
Sort
View
CC
2009
Springer
14 years 22 hour ago
Scheduling Tasks to Maximize Usage of Aggregate Variables in Place
Single-assignment languages with copy semantics have a very simple and approachable programming model. A na¨ıve implementation of the copy semantics that copies the result of eve...
Samah Abu-Mahmeed, Cheryl McCosh, Zoran Budimlic, ...
NHM
2010
87views more  NHM 2010»
13 years 2 months ago
The coolest path problem
We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...
Martin Frank, Armin Fügenschuh, Michael Herty...
TFM
2009
Springer
252views Formal Methods» more  TFM 2009»
14 years 2 months ago
Abstraction and Modelling: A Complementary Partnership
action and Modelling - a complementary partnership” 10h30 – 11h 00 Coffee break 11h-12h30 Session 1 “Model Transformation: Foundations” Algebraic models for bidirectional m...
Jeffrey Kramer
JNW
2006
126views more  JNW 2006»
13 years 7 months ago
Gateway Deployment optimization in Cellular Wi-Fi Mesh Networks
With the standardization of IEEE 802.11, there has been an explosive growth of wireless local area networks (WLAN). Recently, this cost effective technology is being developed aggr...
Rajesh Prasad, Hongyi Wu
APPROX
2006
Springer
120views Algorithms» more  APPROX 2006»
13 years 11 months ago
Single-Source Stochastic Routing
Abstract. We introduce and study the following model for routing uncertain demands through a network. We are given a capacitated multicommodity flow network with a single source an...
Shuchi Chawla, Tim Roughgarden