Sciweavers

1516 search results - page 108 / 304
» The Increasing Nvalue Constraint
Sort
View
KBSE
2009
IEEE
15 years 4 months ago
A Case for Automated Debugging Using Data Structure Repair
—Automated debugging is becoming increasingly important as the size and complexity of software increases. This paper makes a case for using constraint-based data structure repair...
Muhammad Zubair Malik, Khalid Ghori, Bassem Elkara...
HPDC
2003
IEEE
15 years 3 months ago
Using Views for Customizing Reusable Components in Component-Based Frameworks
Increasingly, scalable distributed applications are being constructed by integrating reusable components spanning multiple administrative domains. Dynamic composition and deployme...
Anca-Andreea Ivan, Vijay Karamcheti
TON
2002
99views more  TON 2002»
14 years 9 months ago
Computing shortest paths for any number of hops
In this paper we introduce and investigate a new" path optimization problem which we denote as the All Hops Optimal Path AHOP problem. The problem involves identifying, for a...
Roch Guérin, Ariel Orda
KDD
2002
ACM
166views Data Mining» more  KDD 2002»
15 years 10 months ago
Exploiting response models: optimizing cross-sell and up-sell opportunities in banking
The banking industry regularly mounts campaigns to improve customer value by offering new products to existing customers. In recent years this approach has gained significant mome...
Andrew Storey, Marc-David Cohen
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
15 years 10 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking