Sciweavers

6300 search results - page 61 / 1260
» We have it easy, but do we have it right
Sort
View
OOPSLA
2000
Springer
15 years 4 months ago
Scalable propagation-based call graph construction algorithms
Propagation-based call graph construction algorithms have been studied intensively in the 1990s, and differ primarily in the number of sets that are used to approximate run-time v...
Frank Tip, Jens Palsberg
JCM
2006
112views more  JCM 2006»
15 years 1 months ago
A Peer-to-Peer Cooperation Enhancement Scheme and its Performance Analysis
The performance of peer-to-peer systems depends on the level of cooperation of the system's participants. While most existing peer-to-peer architectures have assumed that user...
Wei-Cherng Liao, Fragkiskos Papadopoulos, Konstant...
CONSTRAINTS
2010
153views more  CONSTRAINTS 2010»
14 years 10 months ago
Philosophy of the MiniZinc challenge
MiniZinc arose as a response to the extended discussion at CP2006 of the need for a standard modelling language for CP. This is a challenging problem, and we believe MiniZinc makes...
Peter J. Stuckey, Ralph Becket, Julien Fischer
IS
2008
15 years 1 months ago
Joining the results of heterogeneous search engines
In recent years, while search engines have become more and more powerful, several specialized search engines have been developed for different domains (e.g. library services, serv...
Daniele Braga, Alessandro Campi, Stefano Ceri, Ale...
IS
2007
15 years 1 months ago
Matching large schemas: Approaches and evaluation
Current schema matching approaches still have to improve for large and complex Schemas. The large search space increases the likelihood for false matches as well as execution time...
Hong Hai Do, Erhard Rahm