Sciweavers

1452 search results - page 222 / 291
» Algorithmic Analysis of Array-Accessing Programs
Sort
View
SOCA
2008
IEEE
15 years 22 days ago
Log-based mining techniques applied to Web service composition reengineering
There is no doubt that SOA and BPM will continue to evolve dependently for the next ten years. Preparing common research infrastructures will require most important efforts of web ...
Walid Gaaloul, Karim Baïna, Claude Godart
107
Voted
SPIN
2010
Springer
14 years 11 months ago
Analysing Mu-Calculus Properties of Pushdown Systems
Pushdown systems provide a natural model of software with recursive procedure calls. We provide a tool implementing an algorithm for computing the winning regions of a pushdown par...
Matthew Hague, C.-H. Luke Ong
FAW
2007
Springer
110views Algorithms» more  FAW 2007»
15 years 7 months ago
Maximizing the Number of Independent Labels in the Plane
In this paper, we consider a map labeling problem to maximize the number of independent labels in the plane. We first investigate the point labeling model that each label can be ...
Kuen-Lin Yu, Chung-Shou Liao, Der-Tsai Lee
SIGSOFT
2007
ACM
16 years 1 months ago
Efficient token based clone detection with flexible tokenization
Code clones are similar code fragments that occur at multiple locations in a software system. Detection of code clones provides useful information for maintenance, reengineering, ...
Hamid Abdul Basit, Stan Jarzabek
159
Voted
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
15 years 1 months ago
Estimating the Average of a Lipschitz-Continuous Function from One Sample
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
Abhimanyu Das, David Kempe