1258 search results - page 14 / 252 » Architecture-driven Problem Decomposition |
PATAT
2004
Springer
14 years 26 days ago
2004
Springer
The timetabling problem consists in fixing a sequence of meetings between teachers and students in a prefixed period of time (typically a week), satisfying a set of constraints of ...
EOR
2006
13 years 7 months ago
2006
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...
EOR
2007
13 years 7 months ago
2007
Video on Demand (VoD) is a technology used to provide a number of programs to a number of users on request. In developing a VoD system, a fundamental problem is load balancing, wh...
SIAMDM
2008
13 years 7 months ago
2008
A well-known theorem of Nash-Williams and Tutte gives a necessary and sufficient condition for the existence of k edge-disjoint spanning trees in an undirected graph. A corollary o...
CONCUR
2010
Springer
13 years 8 months ago
2010
Springer
This paper proposes a geometric solution to the problem of prime decomposability of concurrent processes first explored by R. Milner and F. Moller in [MM93]. Concurrent programs ar...