Sciweavers

881 search results - page 9 / 177
» Solving satisfiability problems with preferences
Sort
View
DATE
1999
IEEE
135views Hardware» more  DATE 1999»
14 years 28 days ago
Combinational Equivalence Checking Using Satisfiability and Recursive Learning
The problem of checking the equivalence of combinational circuits is of key significance in the verification of digital circuits. In recent years, several approaches have been pro...
João P. Marques Silva, Thomas Glass
NIPS
2004
13 years 10 months ago
Learning Preferences for Multiclass Problems
Many interesting multiclass problems can be cast in the general framework of label ranking defined on a given set of classes. The evaluation for such a ranking is generally given ...
Fabio Aiolli, Alessandro Sperduti
CEC
2005
IEEE
13 years 10 months ago
Equilibrium selection by co-evolution for bargaining problems under incomplete information about time preferences
Abstract- The main purpose of this work is to measure the effect of bargaining players’ information completeness on agreements in evolutionary environments. We apply Co-evolution...
Nanlin Jin
ICMCS
1999
IEEE
130views Multimedia» more  ICMCS 1999»
14 years 27 days ago
A Combinatorial Approach to Content-Based Music Selection
Advances in networking and transmission of digital multimedia data will bring soon huge catalogues of music to users. Accessing these catalogues raises a problem for users and con...
François Pachet, Pierre Roy, Daniel Cazaly
CSCLP
2007
Springer
14 years 2 months ago
A Global Filtration for Satisfying Goals in Mutual Exclusion Networks
We formulate a problem of goal satisfaction in mutex networks in this paper. The proposed problem is motivated by problems that arise in concurrent planning. For more efficient sol...
Pavel Surynek