1332 search results - page 237 / 267 » Combinatorial Algorithms |
BMCBI
2002
13 years 7 months ago
2002
Background: Pattern matching is the core of bioinformatics; it is used in database searching, restriction enzyme mapping, and finding open reading frames. It is done repeatedly ov...
STOC
2010
ACM
14 years 19 days ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
ATAL
2003
Springer
14 years 1 months ago
2003
Springer
Despite the success of the BDI approach to agent teamwork, initial role allocation (i.e. deciding which agents to allocate to key roles in the team) and role reallocation upon fai...
GECCO
2003
Springer
14 years 1 months ago
2003
Springer
A network with restoration capability requires spare capacity to be used in the case of failure. Optimization of spare capacity is to find the minimum amount of spare capacity for ...