428 search results - page 14 / 86 » An asynchronous complete method for distributed constraint o... |
ICGI
2010
Springer
13 years 7 months ago
2010
Springer
In this paper we extend the PAC learning algorithm due to Clark and Thollard for learning distributions generated by PDFA to automata whose transitions may take varying time length...
CP
2005
Springer
14 years 2 months ago
2005
Springer
Abstract Competition and cooperation can boost the performance of a combinatorial search process. Both can be implemented with a portfolio of algorithms which run in parallel, give...
ICRA
2002
IEEE
14 years 1 months ago
2002
IEEE
Trajectory design for high-dimensional systems with nonconvex constraints is a challenging problem considered in this paper. Classical dynamic programming is often employed, but c...
NIPS
2003
13 years 10 months ago
2003
We develop a protocol for optimizing dynamic behavior of a network of simple electronic components, such as a sensor network, an ad hoc network of mobile devices, or a network of ...
ICIP
2002
IEEE
14 years 10 months ago
2002
IEEE
In this paper, we present a novel information theoretic approach to image segmentation. We cast the segmentation problem as the maximization of the mutual information between the ...