Sciweavers

1376 search results - page 215 / 276
» Searching Trees: An Essay
Sort
View
KCAP
2005
ACM
15 years 5 months ago
Knowledge base reuse through constraint relaxation
Effective reuse of Knowledge Bases (KBs) often entails the expensive task of identifying plausible KB-PS (Problem Solver) combinations. We propose a novel technique based on Const...
Tomas Eric Nordlander, Derek H. Sleeman, Ken N. Br...
ATAL
2005
Springer
15 years 5 months ago
Modeling complex multi-issue negotiations using utility graphs
This paper presents an agent strategy for complex bilateral negotiations over many issues with inter-dependent valuations. We use ideas inspired by graph theory and probabilistic ...
Valentin Robu, D. J. A. Somefun, Johannes A. La Po...
WEBI
2005
Springer
15 years 5 months ago
Improving Web Clustering by Cluster Selection
Web page clustering is a technology that puts semantically related web pages into groups and is useful for categorizing, organizing, and refining search results. When clustering ...
Daniel Crabtree, Xiaoying Gao, Peter Andreae
FPL
2004
Springer
101views Hardware» more  FPL 2004»
15 years 5 months ago
The Chess Monster Hydra
Abstract. With the help of the FPGA technology, the boarder between hardand software has vanished. It is now possible to develop complex designs and fine grained parallel applicat...
Chrilly Donninger, Ulf Lorenz
3DPVT
2002
IEEE
219views Visualization» more  3DPVT 2002»
15 years 4 months ago
A Multi-Resolution Scheme ICP Algorithm for Fast Shape Registration
The iterative closest point (ICP) algorithm is widely used for the registration of geometric data. One of its main drawbacks is its quadratic time complexity O(N2 ) with the shape...
Timothée Jost, Heinz Hügli