Sciweavers

881 search results - page 106 / 177
» Solving satisfiability problems with preferences
Sort
View
ITSSA
2006
100views more  ITSSA 2006»
13 years 7 months ago
A General Framework for Multi-agent Search with Individual and Global Goals: Stakeholder Search
: Stakeholder search is a general framework for an extension to the improving on the competition approach paradigm for cooperative search that allows for additional individual goal...
Alan Fedoruk, Jörg Denzinger
MP
2008
105views more  MP 2008»
13 years 7 months ago
On the strength of Gomory mixed-integer cuts as group cuts
Gomory mixed-integer (GMI) cuts generated from optimal simplex tableaus are known to be useful in solving mixed-integer programs. Further, it is well-known that GMI cuts can be de...
Sanjeeb Dash, Oktay Günlük
JAR
2000
77views more  JAR 2000»
13 years 7 months ago
Proving Consistency Assertions for Automotive Product Data Management
We present a formal specification and verification approach for industrial product data bases containing Boolean logic formulae to express constraints. Within this framework, globa...
Wolfgang Küchlin, Carsten Sinz
ICSOC
2010
Springer
13 years 6 months ago
A Soft Constraint-Based Approach to QoS-Aware Service Selection
Abstract. Service-based systems should be able to dynamically seek replacements for faulty or underperforming services, thus performing self-healing. It may however be the case tha...
Mohamed Anis Zemni, Salima Benbernou, Manuel Carro
DLOG
2010
13 years 5 months ago
Correcting Access Restrictions to a Consequence
Recent research has shown that annotations are useful for representing access restrictions to the axioms of an ontology and their implicit consequences. Previous work focused on co...
Martin Knechtel, Rafael Peñaloza