16404 search results - page 566 / 3281 » A set coverage problem |
175
click to vote
MP
2002
15 years 6 months ago
2002
Semismooth Newton methods constitute a major research area for solving mixed complementarity problems (MCPs). Early research on semismooth Newton methods is mainly on infeasible me...
238
click to vote
FOSSACS
2009
Springer
16 years 1 months ago
2009
Springer
In this essay we discuss the origin, central results, and some perspectives of algorithmic synthesis of nonterminating reactive programs. We recall the fundamental questions raised...
190
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
We model social choice problems in which self interested agents with private utility functions have to agree on values for a set of variables subject to side constraints. The goal...
165
click to vote
LREC
2010
15 years 8 months ago
2010
In this paper we evaluate the performance of multilabel classification algorithms on the EUR-Lex database of legal documents of the European Union. On the same set of underlying d...
187
click to vote
TASE
2008
IEEE
15 years 7 months ago
2008
IEEE
Dynamic programming, branch-and-bound, and constraint programming are the standard solution principles for nding optimal solutions to machine scheduling problems. We propose a new ...