2107 search results - page 193 / 422 » Computing Small Search Numbers in Linear Time |
164
click to vote
AIPS
2008
15 years 8 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 ...
162
click to vote
ICICS
2005
Springer
15 years 12 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...
161
click to vote
3DIM
2005
IEEE
15 years 8 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...
181
click to vote
PPSC
1997
15 years 7 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...
127
click to vote
PPSN
2004
Springer
15 years 11 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...