881 search results - page 100 / 177 » Solving satisfiability problems with preferences |
136
click to vote
HEURISTICS
2008
15 years 1 months ago
2008
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
134
click to vote
ATAL
2009
Springer
15 years 9 months ago
2009
Springer
The stable marriage problem is a well-known problem of matching men to women so that no man and woman who are not married to each other both prefer each other. Such a problem has ...
140
click to vote
IPPS
2005
IEEE
15 years 8 months ago
2005
IEEE
Mobile Ad-hoc Networks (MANETs) are composed of a set of communicating devices which are able to spontaneously interconnect without any pre-existing infrastructure. In such scenar...
107
click to vote
EVOW
2006
Springer
15 years 6 months ago
2006
Springer
Mobile Ad-hoc Networks (MANETs) are composed of a set of communicating devices which are able to spontaneously interconnect without any pre-existing infrastructure. In such scenari...
161
Voted
AAMAS
2011
Springer
14 years 10 months ago
2011
Springer
The stable marriage problem is a well-known problem of matching men to women so that no man and woman who are not married to each other both prefer each other. Such a problem has a...