1650 search results - page 240 / 330 » The HOM problem is decidable |
158
click to vote
PRIMA
2009
Springer
16 years 26 days ago
2009
Springer
Abstract. We have developed a new two-sided matching protocol including job applicants and employers in the condition that applicants have conditional preferences and well informed...
154
click to vote
SAGT
2009
Springer
16 years 26 days ago
2009
Springer
Abstract. We continue the recently initiated study of the computational aspects of weak saddles, an ordinal set-valued solution concept proposed by Shapley. Brandt et al. gave a po...
160
click to vote
TLCA
2009
Springer
16 years 26 days ago
2009
Springer
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...
162
click to vote
ISSTA
2009
ACM
16 years 25 days ago
2009
ACM
Traditional dynamic program slicing techniques are code-centric, meaning dependences are introduced between executed statement instances, which gives rise to various problems such...
155
click to vote
EVOW
2010
Springer
16 years 24 days ago
2010
Springer
For many real-life engineering optimization problems, the cost of one objective function evaluation can take several minutes or hours. In this context, a popular approach to reduce...