Sciweavers

3897 search results - page 734 / 780
» complexity 2010
Sort
View
SAC
2010
ACM
13 years 9 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
13 years 9 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...
SIGCOMM
2010
ACM
13 years 9 months ago
Cone of silence: adaptively nulling interferers in wireless networks
Dense 802.11 wireless networks present a pressing capacity challenge: users in proximity contend for limited unlicensed spectrum. Directional antennas promise increased capacity b...
Georgios Nikolaidis, Astrit Zhushi, Kyle Jamieson,...
SIGCOMM
2010
ACM
13 years 9 months ago
Energy proportionality of an enterprise network
Energy efficiency is becoming increasingly important in the operation of networking infrastructure, especially in enterprise and data center networks. While strategies for lowerin...
Priya Mahadevan, Sujata Banerjee, Puneet Sharma
SIGECOM
2010
ACM
173views ECommerce» more  SIGECOM 2010»
13 years 9 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