Sciweavers

1138 search results - page 130 / 228
» Parallel Implementation of Constraint Solving
Sort
View
NSPW
2006
ACM
14 years 1 months ago
PKI design for the real world
What would a PKI look like if it were designed for implementability and deployability rather than strict adherence to a particular theoretical or mathematical model? This paper pr...
Peter Gutmann
ISPDC
2005
IEEE
14 years 1 months ago
GMRES Method on Lightweight GRID System
Grid computing accomplishes high throughput computing by using a very large number of unexploited computing resources. We present a parallel method GMRES to solve large sparse lin...
Haiwu He, Guy Bergére, Serge G. Petiton
ECAI
2004
Springer
14 years 1 months ago
IPSS: A Hybrid Reasoner for Planning and Scheduling
In this paper we describe IPSS (Integrated Planning and Scheduling System), a domain independent solver that integrates an AI heuristic planner, that synthesizes courses of actions...
María Dolores Rodríguez-Moreno, Ange...
SAC
2006
ACM
13 years 7 months ago
Efficient interactive configuration of unbounded modular systems
Interactive configuration guides a user searching through a large combinatorial space of solutions to a system of constraints. We investigate a class of very expressive underlying...
Erik Roland van der Meer, Andrzej Wasowski, Henrik...
SIAMJO
2002
133views more  SIAMJO 2002»
13 years 7 months ago
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
Abstract. Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective...
Philip E. Gill, Walter Murray, Michael A. Saunders