4539 search results - page 210 / 908 » Approaches to Compute Workflow Complexity |
119
click to vote
JUCS
2008
15 years 4 months ago
2008
: Nowadays, the complexity of software applications has brought new challenges to developers, having to deal with a large number of computational requirements. Among these requirem...
141
click to vote
MOBIHOC
2010
ACM
15 years 2 months ago
2010
ACM
In geographic (or geometric) routing, messages are expected to route in a greedy manner: the current node always forwards a message to its neighbor node that is closest to the des...
145
click to vote
GRAPHICSINTERFACE
2009
15 years 2 months ago
2009
Despite their numerous applications, efficiently rendering participating media remains a challenging task due to the intricacy of the radiative transport equation. While numerical...
181
click to vote
HEURISTICS
2010
15 years 1 months ago
2010
The urban transit routing problem (UTRP) is NP-Hard and involves devising routes for public transport systems. It is a highly complex multiply constrained problem and the evaluati...
169
click to vote
SAC
2011
ACM
14 years 7 months ago
2011
ACM
We propose a novel approach and tool for collaborative software engineering and development. In model-based software engineering, the underlying data structure is a complex, direc...