Sciweavers

2652 search results - page 444 / 531
» Privacy-preserving linear programming
Sort
View
ESWA
2006
86views more  ESWA 2006»
14 years 10 months ago
Modeling consumer acceptance probabilities
This paper investigates how to estimate the likelihood of a customer accepting a loan offer as a function of the offer parameters and how to choose the optimal set of parameters f...
L. C. Thomas, Ki Mun Jung, Steve D. Thomas, Y. Wu
FMSD
2006
104views more  FMSD 2006»
14 years 10 months ago
Some ways to reduce the space dimension in polyhedra computations
Convex polyhedra are often used to approximate sets of states of programs involving numerical variables. The manipulation of convex polyhedra relies on the so-called double descri...
Nicolas Halbwachs, David Merchat, Laure Gonnord
GRID
2006
Springer
14 years 10 months ago
Workflow Global Computing with YML
In this paper we propose a framework dedicated to the development and the execution of parallel applications over large scale global computing platforms. A workflow programming env...
Olivier Delannoy, Nahid Emad, Serge G. Petiton
IEICET
2006
114views more  IEICET 2006»
14 years 10 months ago
Synchronization Verification in System-Level Design with ILP Solvers
Concurrency is one of the most important issues in system-level design. Interleaving among parallel processes can cause an extremely large number of different behaviors, making de...
Thanyapat Sakunkonchak, Satoshi Komatsu, Masahiro ...
CN
2007
154views more  CN 2007»
14 years 10 months ago
Disjoint multipath routing using colored trees
— Multipath routing (MPR) is an effective strategy to achieve robustness, load balancing, congestion reduction, and increased throughput in computer networks. Disjoint multipath ...
Srinivasan Ramasubramanian, Harish Krishnamoorthy,...