673 search results - page 99 / 135 » Preference-Based Problem Solving for Constraint Programming |
111
click to vote
ICML
2007
IEEE
16 years 2 months ago
2007
IEEE
In this paper we propose a novel, scalable, clustering based Ordinal Regression formulation, which is an instance of a Second Order Cone Program (SOCP) with one Second Order Cone ...
126
click to vote
CP
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...
126
click to vote
ICASSP
2010
IEEE
15 years 2 months ago
2010
IEEE
This paper addresses the problem of locating a single source from noisy range measurements in wireless sensor networks. An approximate solution to the maximum likelihood location ...
119
click to vote
ICML
2010
IEEE
15 years 3 months ago
2010
IEEE
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
138
click to vote
ICCL
1998
IEEE
15 years 6 months ago
1998
IEEE
An aggregate array computation is a loop that computes accumulated quantities over array elements. Such computations are common in programs that use arrays, and the array elements...