2253 search results - page 320 / 451 » An Approach to Specifying Software Frameworks |
128
click to vote
IWAN
1999
Springer
15 years 8 months ago
1999
Springer
There is a need to be able to program network components to adapt to application requirements for quality of service, specialised application dependent routing, to increase effici...
128
click to vote
IDEAS
1998
IEEE
15 years 8 months ago
1998
IEEE
Complex applications consist of a large set of transactions which are interrelated. There are different kinds of dependencies among transactions of a complex application, e.g. ter...
146
click to vote
ESA
2008
Springer
15 years 6 months ago
2008
Springer
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
138
click to vote
CIMAGING
2008
15 years 5 months ago
2008
We present an algorithm to generate samples from probability distributions on the space of curves. Traditional curve evolution methods use gradient descent to find a local minimum...
124
click to vote
AIPS
2004
15 years 5 months ago
2004
We address the issue of incorporating domain-specific preferences in planning systems, where a preference may be seen as a "soft" constraint that it is desirable, but no...