139 search results - page 16 / 28 » Improved Algorithms for the Global Cardinality Constraint |
WWW
2008
ACM
16 years 11 days ago
2008
ACM
Ontology mapping seeks to find semantic correspondences between similar elements of different ontologies. This paper proposes a neural network based approach to search for a globa...
107
click to vote
ICTAI
2003
IEEE
2003
IEEE
Partitioning of Temporal Planning Problems in Mixed Space Using the Theory of Extended Saddle Points
15 years 5 months ago
We study the partitioning of temporal planning problems formulated as mixed-integer nonlinear programming problems, develop methods to reduce the search space of partitioned subpr...
PPDP
2005
Springer
15 years 5 months ago
2005
Springer
The paper describes a constraint-based solution to the protein folding problem on face-centered cubic lattices—a biologically meaningful approximation of the general protein fol...
108
click to vote
AUTOMATICA
2011
14 years 6 months ago
2011
Iterative distributed algorithms are studied for computing arithmetic averages over networks of agents connected through memoryless broadcast erasure channels. These algorithms do...
ECAI
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. In this paper we tackle the problem of coordinating multiple decentralised agents with continuous state variables. Specifically we propose a hybrid approach, which combin...