454 search results - page 67 / 91 » On improving approximate solutions by evolutionary algorithm... |
175
click to vote
PODS
2009
ACM
16 years 2 months ago
2009
ACM
The problem of finding heavy hitters and approximating the frequencies of items is at the heart of many problems in data stream analysis. It has been observed that several propose...
119
click to vote
STOC
2006
ACM
16 years 1 months ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
109
Voted
AAAI
2008
15 years 3 months ago
2008
Diagnosability is an essential property that determines how accurate any diagnostic reasoning can be on a system given any sequence of observations. An unobservable fault event in...
120
click to vote
AIPS
2009
15 years 2 months ago
2009
Solving multiagent planning problems modeled as DECPOMDPs is an important challenge. These models are often solved by using dynamic programming, but the high resource usage of cur...
100
click to vote
PPDP
2005
Springer
15 years 7 months ago
2005
Springer
The paper describes a constraint-based solution to the protein folding problem on face-centered cubic lattices—a biologically meaningful approximation of the general protein fol...