Sciweavers

13376 search results - page 263 / 2676
» Problem Solving with
Sort
View
162
Voted
SCAI
1993
15 years 5 months ago
A Case-Based Answer to Some Problems of Knowledge-Based Systems
Among the most important challenges for contemporary AI research are the development of methods for improved robustness, adaptability, and overall interactiveness of systems. Inter...
Agnar Aamodt
COCOA
2008
Springer
15 years 5 months ago
Computational Study on Dominating Set Problem of Planar Graphs
Abstract: Recently, there have been significant theoretical progresses towards fixed-parameter algorithms for the DOMINATING SET problem of planar graphs. It is known that the prob...
Marjan Marzban, Qian-Ping Gu, Xiaohua Jia
MP
2002
165views more  MP 2002»
15 years 3 months ago
A feasible semismooth asymptotically Newton method for mixed complementarity problems
Semismooth Newton methods constitute a major research area for solving mixed complementarity problems (MCPs). Early research on semismooth Newton methods is mainly on infeasible me...
Defeng Sun, Robert S. Womersley, Houduo Qi
CVPR
2004
IEEE
16 years 5 months ago
A Minimal Solution to the Generalised 3-Point Pose Problem
It is a well known classical result that given the image projections of three known world points it is possible to solve for the pose of a calibrated perspective camera to up to f...
David Nistér
GMP
2006
IEEE
15 years 9 months ago
Simultaneous Precise Solutions to the Visibility Problem of Sculptured Models
Abstract. We present an efficient and robust algorithm for computing continuous visibility for two- or three-dimensional shapes whose boundaries are NURBS curves or surfaces by li...
Joon-Kyung Seong, Gershon Elber, Elaine Cohen