2657 search results - page 255 / 532 » On the complexity of hierarchical problem solving |
164
click to vote
HASE
1998
IEEE
15 years 11 months ago
1998
IEEE
A well-known security problem with MPOA is that cutthrough connections generally bypasses firewall routers if there are any. None of the previously proposed approaches solved the ...
218
click to vote
CIAC
2006
Springer
15 years 10 months ago
2006
Springer
We consider the minimum line covering problem: given a set S of n points in the plane, we want to find the smallest number l of straight lines needed to cover all n points in S. W...
160
Voted
WSC
2007
15 years 9 months ago
2007
The Cross-Entropy (CE) method is a modern and effective optimization method well suited to parallel implementations. There is a vast array of problems today, some of which are hig...
190
click to vote
COCO
2008
Springer
15 years 8 months ago
2008
Springer
We study the complexity of deciding whether a given homogeneous multivariate polynomial has a nontrivial root over a finite field. Given a homogeneous algebraic circuit C that com...
179
Voted
UAI
2008
15 years 8 months ago
2008
This paper describes a new algorithm to solve the decision making problem in Influence Diagrams based on algorithms for credal networks. Decision nodes are associated to imprecise...