Sciweavers

8695 search results - page 1696 / 1739
» Making the Complex Simple
Sort
View
HPDC
2010
IEEE
14 years 11 months ago
Towards optimising distributed data streaming graphs using parallel streams
Modern scientific collaborations have opened up the opportunity of solving complex problems that involve multidisciplinary expertise and large-scale computational experiments. The...
Chee Sun Liew, Malcolm P. Atkinson, Jano I. van He...
BPM
2010
Springer
128views Business» more  BPM 2010»
14 years 10 months ago
Content-Aware Resolution Sequence Mining for Ticket Routing
Ticket routing is key to the efficiency of IT problem management. Due to the complexity of many reported problems, problem tickets typically need to be routed among various expert ...
Peng Sun, Shu Tao, Xifeng Yan, Nikos Anerousis, Yi...
SAC
2010
ACM
14 years 10 months ago
Graph-based verification of static program constraints
Software artifacts usually have static program constraints and these constraints should be satisfied in each reuse. In addition to this, the developers are also required to satisf...
Selim Ciraci, Pim van den Broek, Mehmet Aksit
SIGCOMM
2010
ACM
14 years 10 months ago
Cloudward bound: planning for beneficial migration of enterprise applications to the cloud
In this paper, we tackle challenges in migrating enterprise services into hybrid cloud-based deployments, where enterprise operations are partly hosted on-premise and partly in th...
Mohammad Y. Hajjat, Xin Sun, Yu-Wei Eric Sung, Dav...
SIGECOM
2010
ACM
173views ECommerce» more  SIGECOM 2010»
14 years 10 months ago
Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna
« Prev « First page 1696 / 1739 Last » Next »