Sciweavers

601 search results - page 29 / 121
» CSP(M): Constraint Satisfaction Problem over Models
Sort
View
STACS
2005
Springer
15 years 3 months ago
The Core of a Countably Categorical Structure
ded abstract of this article is published in the proceedings of STACS’05, LNCS 3404, Springer Verlag. A relational structure is a core, if all its endomorphisms are embeddings. T...
Manuel Bodirsky
ACIIDS
2009
IEEE
122views Database» more  ACIIDS 2009»
15 years 4 months ago
How to Maximize User Satisfaction Degree in Multi-service IP Networks
—Bandwidth allocation is a fundamental problem in communication networks. With current network moving towards the Future Internet model, the problem is further intensified as net...
Huy Anh Nguyen, Tam Van Nguyen, Deokjai Choi
77
Voted
CP
2008
Springer
14 years 11 months ago
A Branch and Bound Algorithm for Numerical MAX-CSP
The Constraint Satisfaction Problem (CSP) framework allows users to define problems in a declarative way, quite independently from the solving process. However, when the problem i...
Jean-Marie Normand, Alexandre Goldsztejn, Marc Chr...
96
Voted
AIPS
2006
14 years 11 months ago
Planning for PDDL3 - An OCSP Based Approach
Recent research in AI Planning is focused on improving the quality of the generated plans. PDDL3 incorporates hard and soft constraints on goals and the plan trajectory. Plan traj...
Bharat Ranjan Kavuluri, Naresh Babu Saladi, Deepak...
CSL
2010
Springer
14 years 10 months ago
The Complexity of Positive First-Order Logic without Equality II: The Four-Element Case
We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over fixed, finite structures B. This may be seen as a natural generalisation of th...
Barnaby Martin, Jos Martin