1071 search results - page 75 / 215 » Solving Geometric Constraint Systems |
FLAIRS
2004
14 years 11 months ago
2004
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
CPAIOR
2010
Springer
14 years 8 months ago
2010
Springer
Many search problems contain large amounts of redundancy in the search. In this paper we examine how to automatically exploit remaining subproblem equivalence, which arises when tw...
IPCO
2008
14 years 11 months ago
2008
Orbital branching is a method for branching on variables in integer programming that reduces the likelihood of evaluating redundant, isomorphic nodes in the branch-and-bound proce...
100
click to vote
CP
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. Interval-based methods can approximate all the real solutions of a system of equations and inequalities. The Box interval constraint propagation algorithm enforces Box co...
GLOBECOM
2009
IEEE
15 years 1 months ago
2009
IEEE
Abstract--Current multibeam satellite systems perform centralized power and carrier allocation assuming a Multi-Frequency Time Division Multiple Access (MF-TDMA) scheme with fixed ...