Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
214
A SAT-based version space algorithm for acquiring constraint satisfaction problems
- In Proceedings of ECML’05
, 2005
"... Abstract. Constraint programming is rapidly becoming the technology of choice for modelling and solving complex combinatorial problems. However, users of this technology need significant expertise in order to model their problem appropriately. The lack of availability of such expertise is a signific ..."
Abstract
-
Cited by 21 (8 self)
- Add to MetaCart
significant bottleneck to the broader uptake of constraint technology in the real world. We present a new SATbased version space algorithm for acquiring constraint satisfaction problems from examples of solutions and non-solutions of the target problem. We show how domain-specific knowledge related
Acquiring Constraint Networks using a SAT-based Version Space Algorithm
- In ECML
, 2005
"... Constraint programming is a commonly used technology for solving complex combinatorial problems. However, users of this technology need significant expertise in order to model their problems appropriately. We propose a basis for addressing this problem: a new SAT-based version space algorithm f ..."
Abstract
- Add to MetaCart
Constraint programming is a commonly used technology for solving complex combinatorial problems. However, users of this technology need significant expertise in order to model their problems appropriately. We propose a basis for addressing this problem: a new SAT-based version space algorithm
To cite this version:
, 2015
"... HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci-entific research documents, whether they are pub-lished or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte p ..."
Abstract
- Add to MetaCart
algorithm for large-scale two-stage unit-commitment W. van Ackooij · J. Malick Received: date / Accepted: date Abstract Everyday, electricity generation companies submit a generation schedule to the grid operator for the coming day; computing an optimal schedule is called the unit-commitment problem
IEEE TRANSACTIONS ON MAGNETICS 1 Robust Multi-Objective TEAM 22 Problem: A Case Study of Uncertainties in Design Optimization
"... This paper describes a robust version to the TEAM 22 benchmark optimization problem and presents the methodology WCSA (worst case scenario approximation) to solve this problem and other similar cases. The robust multi-objective TEAM 22 model was built from its classical configuration by assuming the ..."
Abstract
- Add to MetaCart
This paper describes a robust version to the TEAM 22 benchmark optimization problem and presents the methodology WCSA (worst case scenario approximation) to solve this problem and other similar cases. The robust multi-objective TEAM 22 model was built from its classical configuration by assuming
IEEE TRANSACTIONS ON MAGNETICS 1 Robust Multi-Objective TEAM 22 Problem: A Case Study of Uncertainties in Design Optimization
"... This paper describes a robust version to the TEAM 22 benchmark optimization problem and presents the methodology WCSA (worst case scenario approximation) to solve this problem and other similar cases. The robust multi-objective TEAM 22 model was built from its classical configuration by assuming the ..."
Abstract
- Add to MetaCart
This paper describes a robust version to the TEAM 22 benchmark optimization problem and presents the methodology WCSA (worst case scenario approximation) to solve this problem and other similar cases. The robust multi-objective TEAM 22 model was built from its classical configuration by assuming
for Sparse Translation-Invariant Signals
"... Document Version Early version, also known as pre-print Link to publication from Aalborg University Citation for published version (APA): ..."
Abstract
- Add to MetaCart
Document Version Early version, also known as pre-print Link to publication from Aalborg University Citation for published version (APA):
Self-Stabilizing TDMA Algorithms for Dynamic Wireless Ad-hoc Networks ∗
"... In dynamic wireless ad-hoc networks (DynWANs), autonomous computing devices set up a network for the communication needs of the moment. These networks require the implementation of a medium access control (MAC) layer. We consider MAC protocols for DynWANs that need to be autonomous and robust as wel ..."
Abstract
- Add to MetaCart
of these timing requirements. We propose a self-stabilizing MAC algorithm for DynWANs that guarantees a short convergence period, and by that, it can facilitate the satisfaction of severe timing requirements, such as the above. Besides the contribution in the algorithmic front of research, we expect that our
Research Article Self-Stabilizing TDMA Algorithms for Dynamic Wireless
"... This document has been downloaded from Chalmers Publication Library (CPL). It is the author´s version of a work that was accepted for publication in: ..."
Abstract
- Add to MetaCart
This document has been downloaded from Chalmers Publication Library (CPL). It is the author´s version of a work that was accepted for publication in:
INSTITUT DE ROB `OTICA I INFORM `ATICA INDUSTRIAL- PREPRINT 1 A Branch-and-Prune Solver for Distance Constraints
"... 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
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
Results 1 - 10
of
214
