4860 search results - page 395 / 972 » SNPs Problems, Complexity, and Algorithms |
119
Voted
COMPSAC
2003
IEEE
15 years 9 months ago
2003
IEEE
With the rise of distributed e-commerce in recent years, demand for automated negotiation has increased. In turn, this has facilitated a demand for ever more complex algorithms to...
112
Voted
CP
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...
110
Voted
IROS
2008
IEEE
15 years 10 months ago
2008
IEEE
— Motion and path-planning algorithms often use complex cost functions for both global navigation and local smoothing of trajectories. Obtaining good results typically requires c...
170
Voted
DAGM
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. In this paper, we present a novel method for reducing the computational complexity of a Support Vector Machine (SVM) classifier without significant loss of accuracy. We a...
117
Voted
ECAI
2006
Springer
15 years 7 months ago
2006
Springer
We present a detailed study of two inverse consistencies for non-binary constraints: relational path inverse consistency (rel PIC) and pairwise inverse consistency (PWIC). These ar...