Sciweavers

728 search results - page 134 / 146
» Bargaining with incomplete information
Sort
View
LPNMR
2005
Springer
14 years 1 months ago
Data Integration: a Challenging ASP Application
Abstract. The paper presents INFOMIX a successful application of ASP technology to the domain of Data Integration. INFOMIX is a novel system which supports powerful information int...
Nicola Leone, Thomas Eiter, Wolfgang Faber, Michae...
SIGSOFT
2008
ACM
14 years 8 months ago
Javert: fully automatic mining of general temporal properties from dynamic traces
Program specifications are important for many tasks during software design, development, and maintenance. Among these, temporal specifications are particularly useful. They expres...
Mark Gabel, Zhendong Su
PLDI
2009
ACM
14 years 8 months ago
SoftBound: highly compatible and complete spatial memory safety for c
The serious bugs and security vulnerabilities facilitated by C/C++'s lack of bounds checking are well known, yet C and C++ remain in widespread use. Unfortunately, C's a...
Santosh Nagarakatte, Jianzhou Zhao, Milo M. K. Mar...
PODC
2009
ACM
14 years 8 months ago
Brief announcement: global consistency can be easier than point-to-point communication
Global consistency or Byzantine Agreement (BA) and reliable point-to-point communication are two of the most important and well-studied problems in distributed computing. Informal...
Prasant Gopal, Anuj Gupta, Pranav K. Vasishta, Piy...
KDD
2004
ACM
148views Data Mining» more  KDD 2004»
14 years 8 months ago
Spying Out Accurate User Preferences for Search Engine Adaptation
Abstract. Most existing search engines employ static ranking algorithms that do not adapt to the specific needs of users. Recently, some researchers have studied the use of clickth...
Lin Deng, Wilfred Ng, Xiaoyong Chai, Dik Lun Lee