Sciweavers

19003 search results - page 199 / 3801
» We Need Assurance!
Sort
View
APPROX
2010
Springer
207views Algorithms» more  APPROX 2010»
14 years 7 days ago
Exploiting Concavity in Bimatrix Games: New Polynomially Tractable Subclasses
Abstract. We study the fundamental problem of computing an arbitrary Nash equilibrium in bimatrix games. We start by proposing a novel characterization of the set of Nash equilibri...
Spyros C. Kontogiannis, Paul G. Spirakis
AI
2008
Springer
13 years 10 months ago
Alternating-offers bargaining with one-sided uncertain deadlines: an efficient algorithm
In the arena of automated negotiations we focus on the principal negotiation protocol in bilateral settings, i.e. the alternatingoffers protocol. In the scientific community it is...
Nicola Gatti, Francesco Di Giunta, Stefano Marino
SIGCOMM
2010
ACM
13 years 11 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...
KIVS
2011
Springer
13 years 1 months ago
A Feasibility Check for Geographical Cluster Based Routing under Inaccurate Node Localization in Wireless Sensor Networks
Localized geographic single path routing along a wireless network graph requires exact location information about the network nodes to assure message delivery guarantees. Node loc...
Hannes Frey, Ranjith Pillay
ACMICEC
2007
ACM
144views ECommerce» more  ACMICEC 2007»
14 years 2 months ago
Needs-based analysis of online customer reviews
Needs-based analysis lies at the intersection of product marketing and new product development. It is the study of why consumers purchase and what they do with those purchases. In...
Thomas Y. Lee