Sciweavers

3057 search results - page 433 / 612
» Complexity management
Sort
View
123
Voted
PODS
2008
ACM
123views Database» more  PODS 2008»
16 years 3 months ago
Evaluating rank joins with optimal cost
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
Karl Schnaitter, Neoklis Polyzotis
115
Voted
MOBIHOC
2004
ACM
16 years 3 months ago
Error characteristics of ad hoc positioning systems (aps)
APS algorithms use the basic idea of distance vector routing to find positions in an ad hoc network using only a fraction of landmarks, for example GPS enabled nodes. All the node...
Dragos Niculescu, Badri Nath
PPOPP
2010
ACM
16 years 21 days ago
Application heartbeats for software performance and health
Adaptive, or self-aware, computing has been proposed to help application programmers confront the growing complexity of multicore software development. However, existing approache...
Henry Hoffmann, Jonathan Eastep, Marco D. Santambr...
141
Voted
ICWS
2009
IEEE
16 years 19 days ago
A Conceptual Modeling Approach to Business Service Mashup Development
Professional mashups that include complex choreographies, data mediation, and result publishing within Web pages are still affected by implementation and design practices that rel...
Alessandro Bozzon, Marco Brambilla, Federico Miche...
119
Voted
PEPM
2010
ACM
16 years 10 days ago
Clone detection and elimination for Haskell
Duplicated code is a well known problem in software maintenance and refactoring. Code clones tend to increase program size and several studies have shown that duplicated code make...
Christopher Brown, Simon Thompson