1046 search results - page 55 / 210 » Approximation Algorithms for Domination Search |
116
Voted
AAAI
2008
15 years 2 months ago
2008
This paper considers the problem of an agent searching for a resource or a tangible good in a physical environment, where at each stage of its search it observes one source where ...
101
Voted
RECOMB
2002
Springer
16 years 23 days ago
2002
Springer
This talk presents an algorithm to search for all approximate matches of a helix in a genome, where a helix is a combination of sequence and folding constraints. It is a joint wor...
119
click to vote
UAI
1996
15 years 1 months ago
1996
Inference algorithms for arbitrary belief networks are impractical for large, complex belief networks. Inference algorithms for specialized classes of belief networks have been sh...
110
click to vote
GECCO
2008
Springer
15 years 1 months ago
2008
Springer
We propose the use of rough sets theory to improve the first approximation provided by a multi-objective evolutionary algorithm and retain the nondominated solutions using a new ...
109
click to vote
WAOA
2004
Springer
15 years 5 months ago
2004
Springer
SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET /WDM rings. The number of SONET ADMs required by a set of traffic streams is determined by the routing and...