Sciweavers

984 search results - page 180 / 197
» ideas 2010
Sort
View
SIGECOM
2010
ACM
173views ECommerce» more  SIGECOM 2010»
15 years 4 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
SIGIR
2010
ACM
15 years 4 months ago
Visual summarization of web pages
Visual summarization is an attractive new scheme to summarize web pages, which can help achieve a more friendly user experience in search and re-finding tasks by allowing users qu...
Binxing Jiao, Linjun Yang, Jizheng Xu, Feng Wu
TLDI
2010
ACM
198views Formal Methods» more  TLDI 2010»
15 years 4 months ago
Verifying event-driven programs using ramified frame properties
Interactive programs, such as GUIs or spreadsheets, often maintain dependency information over dynamically-created networks of objects. That is, each imperative object tracks not ...
Neel R. Krishnaswami, Lars Birkedal, Jonathan Aldr...
ICECCS
2010
IEEE
219views Hardware» more  ICECCS 2010»
15 years 4 months ago
Comparison of Six Ways to Extend the Scope of Cheddar to AADL v2 with Osate
Abstract—Cheddar is a framework dedicated to the specification of real-time schedulers, and to their analysis by simulation. It is developed in Ada. Some parts of its modular ar...
Mickaël Kerboeuf, Alain Plantec, Frank Singho...
CL
2010
Springer
15 years 4 months ago
Isolating untrusted software extensions by custom scoping rules
In a modern programming language, scoping rules determine the visibility of names in various regions of a program [15]. In this work, we examine the idea of allowing an applicatio...
Philip W. L. Fong, Simon A. Orr