Sciweavers

338 search results - page 17 / 68
» On the Complexity of Termination Inference for Processes
Sort
View
FOCS
2007
IEEE
15 years 4 months ago
On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract)
d Abstract) Kousha Etessami LFCS, School of Informatics University of Edinburgh Mihalis Yannakakis Department of Computer Science Columbia University We reexamine what it means to...
Kousha Etessami, Mihalis Yannakakis
PODC
2010
ACM
15 years 1 months ago
Eventually linearizable shared objects
Linearizability is the strongest known consistency property of shared objects. In asynchronous message passing systems, Linearizability can be achieved with 3S and a majority of c...
Marco Serafini, Dan Dobre, Matthias Majuntke, P&ea...
ADL
2000
Springer
284views Digital Library» more  ADL 2000»
15 years 2 months ago
A Boolean Query Processing with a Result Cache in Mediator Systems
A mediator system is a kind of a meta-search engine that provides a seamlessly integrated search service for diverse search engines (collections). Since collections of a mediator ...
Jae-Heon Cheong, Sang-goo Lee
NLE
2008
109views more  NLE 2008»
14 years 9 months ago
Natural language processing in CLIME, a multilingual legal advisory system
This paper describes clime, a web-based legal advisory system with a multilingual natural language interface. clime is a `proof-of-concept' system which answers queries relat...
Roger Evans, Paul Piwek, Lynne J. Cahill, Neil Tip...
FM
2009
Springer
92views Formal Methods» more  FM 2009»
15 years 4 months ago
Field-Sensitive Value Analysis by Field-Insensitive Analysis
Shared and mutable data-structures pose major problems in static analysis and most analyzers are unable to keep track of the values of numeric variables stored in the heap. In this...
Elvira Albert, Puri Arenas, Samir Genaim, Germ&aac...