729 search results - page 111 / 146 » Solving subgraph isomorphism problems with constraint progra... |
142
click to vote
CP
2003
Springer
15 years 9 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...
144
click to vote
ICASSP
2010
IEEE
15 years 4 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 ...
134
click to vote
ICML
2010
IEEE
15 years 4 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 ...
162
click to vote
ICCL
1998
IEEE
15 years 8 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...
175
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
—In a sensor network, in practice, the communication among sensors is subject to: 1) errors that can cause failures of links among sensors at random times; 2) costs; and 3) const...