Results 1 - 10 of 318

The G12 project: Mapping solver independent models to efficient solutions

by Peter J. Stuckey, Maria Garcia De La B, Michael Maher, John Slaney, Zoltan Somogyi, Mark Wallace, Toby Walsh - Proceedings of the 21st International Conference on Logic Programming, number 3668 in LNCS , 2005
"... Abstract. The G12 project recently started by National ICT Australia (NICTA) is an ambitious project to develop a software platform for solving large scale industrial combinatorial optimisation problems. The core design involves three languages: Zinc, Cadmium and Mercury (Group 12 of the periodic ta ..."
Abstract - Cited by 21 (11 self) - Add to MetaCart
for building extensible and hybridizable solvers. The same Zinc model, used with different Cadmium mappings, will allow us to experiment with different complete, local, or hybrid search approaches for the same problem. This talk will explain the G12 global design, the final G12 objectives, and our progress so

From High-Level Model to Branch-and-Price Solution in G12

by Jakob Puchinger, Peter J. Stuckey, Mark Wallace, Sebastian Brand , 2008
"... The G12 project is developing a software environment for stating and solving combinatorial problems by mapping a high-level model of the problem to an efficient combination of solving methods. Model annotations are used to control this process. In this paper we explain the mapping to branch-and-pr ..."
Abstract - Cited by 5 (2 self) - Add to MetaCart
The G12 project is developing a software environment for stating and solving combinatorial problems by mapping a high-level model of the problem to an efficient combination of solving methods. Model annotations are used to control this process. In this paper we explain the mapping to branch

Composing Constraint Solvers

by Peter Zoeteweij
"... The subject of this thesis can be categorized as the implementation of constraint solvers. In this chapter we put constraint solving, and the programming style that it enables into context. We motivate our work, give an outline of the thesis, and summarize the scientific contributions. 1.1 Context ..."
Abstract - Add to MetaCart
combinatorial problem that occurs in practice is called modeling. The purpose of constraint solving is to generate solutions to CSPs. These are assignments of values to variables that satisfy all constraints. We will also consider a modification of constraint satisfaction problems where the goal is to generate

Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles). In: Dwork

by Xavier Boyen , Brent Waters - CRYPTO 2006. LNCS, , 2006
"... Abstract We present an identity-based cryptosystem that features fully anonymous ciphertexts and hierarchical key delegation. We give a proof of security in the standard model, based on the mild Decision Linear complexity assumption in bilinear groups. The system is efficient and practical, with sm ..."
Abstract - Cited by 119 (10 self) - Add to MetaCart
practical solutions. The Boneh-Franklin IBE scheme was based on groups with efficiently computable bilinear maps, while the Cocks scheme was proven secure under the quadratic residuosity problem, which relies on the hardness of factoring. The security of either scheme was only proven in the random oracle

High-Performance Multigrid Solvers in Reconfigurable Hardware

by Safaa J. Kasbah, Issam W. Damaj
"... Abstract—Partial Differential Equations (PDEs) play an essential role in modeling real world problems. The broad field of modeling such systems has drawn the researchers ’ attention for designing efficient algorithms for solving PDEs. Multigrid solvers have been shown to be the fastest due to its hi ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Abstract—Partial Differential Equations (PDEs) play an essential role in modeling real world problems. The broad field of modeling such systems has drawn the researchers ’ attention for designing efficient algorithms for solving PDEs. Multigrid solvers have been shown to be the fastest due to its

Integral projection models for species with complex demography.

by Stephen P Ellner , Mark Rees - American Naturalist , 2006
"... abstract: Matrix projection models occupy a central role in population and conservation biology. Matrix models divide a population into discrete classes, even if the structuring trait exhibits continuous variation (e.g., body size). The integral projection model (IPM) avoids discrete classes and po ..."
Abstract - Cited by 42 (6 self) - Add to MetaCart
abstract: Matrix projection models occupy a central role in population and conservation biology. Matrix models divide a population into discrete classes, even if the structuring trait exhibits continuous variation (e.g., body size). The integral projection model (IPM) avoids discrete classes

INSTITUT DE ROB `OTICA I INFORM `ATICA INDUSTRIAL- PREPRINT 1 A Branch-and-Prune Solver for Distance Constraints

by Josep M. Porta, Federico Thomas, Carme Torras
"... Abstract — Given some geometric elements such as points and lines in , subject to a set of pairwise distance constraints, the problem tackled in this paper is that of finding all possible configurations of these elements that satisfy the constraints. Many problems in Robotics (such as the position ..."
Abstract - Add to MetaCart
. Finding these distances relies on a branch-and-prune technique that iteratively eliminates from the space of distances entire regions which cannot contain any solution. This elimination is accomplished by applying redundant necessary conditions derived from the theory of Distance Geometry

Dantzig-Wolfe Decomposition and Branch-and-Price Solving in G12

by Jakob Puchinger, Peter J. Stuckey, Mark Wallace, Sebastian Brand - CONSTRAINTS
"... The date of receipt and acceptance will be inserted by the editor Abstract The G12 project is developing a software environment for stating and solving combinatorial problems by mapping a high-level model of the problem to an efficient combination of solving methods. Model annotations are used to co ..."
Abstract - Cited by 7 (0 self) - Add to MetaCart
The date of receipt and acceptance will be inserted by the editor Abstract The G12 project is developing a software environment for stating and solving combinatorial problems by mapping a high-level model of the problem to an efficient combination of solving methods. Model annotations are used

Mapping Conformant Planning into SAT through Compilation and Projection

by Héctor Palacios, Héctor Geffner , 2005
"... Conformant planning is a variation of classical AI planning where the initial state is partially known and actions can have nondeterministic effects. While a classical plan must achieve the goal from a given initial state using deterministic actions, a conformant plan must achieve the goal in the p ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
by Giunchiglia and colleagues, thus follow a generate-and-test strategy: the models of the theory are generated one by one using a SAT solver (assuming a given planning horizon), and from each such model, a candidate conformant plan is extracted and tested for validity using another SAT call. This works well

Modeling the hemodynamic response function in fMRI: efficiency, bias and mis-modeling. Neuroimage

by Martin A Lindquist , Ji Meng Loh , Lauren Y Atlas , Tor D Wager , 2009
"... Most brain research to date have focused on studying the amplitude of evoked fMRI responses, though there has recently been an increased interest in measuring onset, peak latency and duration of the responses as well. A number of modeling procedures provide measures of the latency and duration of f ..."
Abstract - Cited by 34 (4 self) - Add to MetaCart
(e.g., the gamma based models and IL), and hence estimates of H, T and W can be derived analytically. A lack of closed form solution (e.g., for FIR models) does not preclude estimating values from the fitted HRFs, and procedures for doing so are described in Section B of the Appendix. However, when
Results 1 - 10 of 318