14078 search results - page 131 / 2816 » Design and Analysis of Computer Algorithms |
156
click to vote
UAI
2008
15 years 7 months ago
2008
While known algorithms for sensitivity analysis and parameter tuning in probabilistic networks have a running time that is exponential in the size of the network, the exact comput...
165
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
158
click to vote
CEC
2008
IEEE
16 years 25 days ago
2008
IEEE
Abstract— This paper presents a new efficient multiobjective evolutionary algorithm for solving computationallyintensive optimization problems. To support a high degree of parall...
153
click to vote
WSC
2001
15 years 7 months ago
2001
Simulation beginners often spend a great amount of time to accumulate the knowledge as well as the experience to overcome the technical complexity of computer simulation. Limited ...
168
click to vote
INFOCOM
1997
IEEE
15 years 10 months ago
1997
IEEE
In earlier work we have formulated a collusion problem that determines whether it is possible for a set of colluders to collectively discover a target set of information, starting...