16404 search results - page 358 / 3281 » A set coverage problem |
133
click to vote
SODA
2012
ACM
13 years 7 months ago
2012
ACM
The Matroid Secretary Problem, introduced by Babaioff et al. (2007), is a generalization of the Classical Secretary Problem. In this problem, elements from a matroid are presente...
133
click to vote
CP
2005
Springer
15 years 10 months ago
2005
Springer
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed m...
126
click to vote
SAT
2004
Springer
15 years 10 months ago
2004
Springer
The Walksat local search algorithm has previously been extended to handle quantification over variables. This greatly reduces model sizes, but in order to guide greedy moves the a...
142
Voted
ICCS
2003
Springer
15 years 10 months ago
2003
Springer
Application portals, or Problem Solving Environments (PSEs), provide user environments that simplify access and integrate various distributed computational services for scientists ...
146
click to vote
ACSD
2009
IEEE
15 years 10 months ago
2009
IEEE
The application of synthesis of Petri nets from languages for practical problems has recently attracted increasing attention. However, the classical synthesis problems are often n...