Sciweavers

144 search results - page 14 / 29
» Solving Regular Tree Grammar Based Constraints
Sort
View
CSCLP
2008
Springer
15 years 1 months ago
An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
Khalil Djelloul
TIP
2010
160views more  TIP 2010»
14 years 6 months ago
Development and Optimization of Regularized Tomographic Reconstruction Algorithms Utilizing Equally-Sloped Tomography
We develop two new algorithms for tomographic reconstruction which incorporate the technique of equally-sloped tomography (EST) and allow for the optimized and flexible implementat...
Yu Mao, Benjamin P. Fahimian, Stanley Osher, Jianw...
CPAIOR
2005
Springer
15 years 5 months ago
Constraint Programming Based Column Generation for Employee Timetabling
The Employee Timetabling Problem (ETP) is a general class of problems widely encountered in service organizations (such as call centers for instance). Given a set of activities, a ...
Sophie Demassey, Gilles Pesant, Louis-Martin Rouss...
GLOBECOM
2008
IEEE
15 years 6 months ago
Impact of Constraints on the Complexity of Dynamic Spectrum Assignment
— In this paper we study the complexity of spectrum assignment problems in cognitive radio networks (CRNs) in the presence of several constraints. Although optimal spectrum assig...
Chetan Nanjunda Mathur, Mohamed A. Haleem, Rajarat...
AI
2010
Springer
14 years 11 months ago
AllDifferent-based filtering for subgraph isomorphism
The subgraph isomorphism problem involves deciding if there exists a copy of a pattern graph in a target graph. This problem may be solved by a complete tree search combined with ...
Christine Solnon