2107 search results - page 193 / 422 » Computing Small Search Numbers in Linear Time |
132
click to vote
AIPS
2008
15 years 6 months ago
2008
We present an algorithm that quickly finds optimal plans for unforeseen agent preferences within graph-based planning domains where actions have deterministic outcomes and action ...
132
click to vote
ICICS
2005
Springer
15 years 9 months ago
2005
Springer
Private itemset support counting (PISC) is a basic building block of various privacy-preserving data mining algorithms. Briefly, in PISC, Client wants to know the support of her i...
118
click to vote
3DIM
2005
IEEE
15 years 5 months ago
2005
IEEE
We give a formal definition of geometric fitting in a way that suits computer vision applications. We point out that the performance of geometric fitting should be evaluated in...
152
Voted
PPSC
1997
15 years 5 months ago
1997
We present the preliminary design for a C++ template library to enable the compositional construction of matrix classes suitable for high performance numerical linear algebra comp...
PPSN
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Many real-world optimization problems have several, usually conflicting objectives. Evolutionary multi-objective optimization usually solves this predicament by searchin...