5263 search results - page 212 / 1053 » Open Constraint Optimization |
139
click to vote
CP
1995
Springer
15 years 7 months ago
1995
Springer
We present a new heuristic approach for maximal constraint satisfaction of overconstrained problems (MAX-CSP). This approach is based on a formulation of CSP as an optimization pro...
143
click to vote
IPCO
2008
15 years 5 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...
156
click to vote
IJCAI
2007
15 years 5 months ago
2007
The task of learning models for many real-world problems requires incorporating domain knowledge into learning algorithms, to enable accurate learning from a realistic volume of t...
133
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
On a multiantenna broadcast channel, simultaneous transmission to multiple users by joint beamforming and scheduling is capable of achieving high throughput, which grows double log...
131
click to vote
IS
2008
15 years 4 months ago
2008
Consistent query answering is the problem of characterizing and computing the semantically correct answers to queries from a database that may not satisfy certain integrity constr...