Sciweavers

1723 search results - page 282 / 345
» Cycling in linear programming problems
Sort
View
SC
1994
ACM
15 years 1 months ago
A parallel formulation of interior point algorithms
In recent years, interior point algorithms have been used successfully for solving mediumto large-size linear programming LP problems. In this paper we describe a highly parallel ...
George Karypis, Anshul Gupta, Vipin Kumar
CASES
2007
ACM
15 years 1 months ago
Application driven embedded system design: a face recognition case study
The key to increasing performance without a commensurate increase in power consumption in modern processors lies in increasing both parallelism and core specialization. Core speci...
Karthik Ramani, Al Davis
AAAI
2007
14 years 12 months ago
Counting CSP Solutions Using Generalized XOR Constraints
We present a general framework for determining the number of solutions of constraint satisfaction problems (CSPs) with a high precision. Our first strategy uses additional binary...
Carla P. Gomes, Willem Jan van Hoeve, Ashish Sabha...
ECAI
2008
Springer
14 years 11 months ago
Optimizing Causal Link Based Web Service Composition
Automation of Web service composition is one of the most interesting challenges facing the Semantic Web today. Since Web services have been enhanced with formal semantic descriptio...
Freddy Lécué, Alexandre Delteil, Ala...
EUROPAR
2008
Springer
14 years 11 months ago
Optimized Pipelined Parallel Merge Sort on the Cell BE
Chip multiprocessors designed for streaming applications such as Cell BE offer impressive peak performance but suffer from limited bandwidth to offchip main memory. As the number o...
Jörg Keller, Christoph W. Kessler