16404 search results - page 508 / 3281 » A set coverage problem |
174
click to vote
AAAI
2000
15 years 8 months ago
2000
We develop a normative theory of interaction-negotiation in particular--among self-interested computationally limited agents where computational actions are game-theoretically tre...
178
click to vote
COR
2007
15 years 6 months ago
2007
We present new primal-dual algorithms for several network design problems. The problems considered are the generalized Steiner tree problem (GST), the directed Steiner tree proble...
170
click to vote
CCE
2004
15 years 6 months ago
2004
This paper treats the solution of nonlinear optimization problems involving discrete decision variables, also known as generalized disjunctive programming (GDP) or mixed-integer n...
209
Voted
CSR
2007
Springer
16 years 1 months ago
2007
Springer
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
181
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....