230 search results - page 1 / 46 » Constraint Orbital Branching |
IPCO
2008
13 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...
IPCO
2007
13 years 5 months ago
2007
We introduce orbital branching, an effective branching method for integer programs containing a great deal of symmetry. The method is based on computing groups of variables that a...
APPROX
2009
Springer
13 years 11 months ago
2009
Springer
Motivated by questions in property testing, we search for linear error-correcting codes that have the “single local orbit” property: i.e., they are specified by a single loca...
ATAL
2006
Springer
13 years 8 months ago
2006
Springer
Deciding what to branch on at each node is a key element of search algorithms. We present four families of methods for selecting what question to branch on. They are all informati...
ICRA
2007
IEEE
13 years 10 months ago
2007
IEEE
—This paper addresses the design considerations and dexterity evaluation of a novel hybrid two-armed micro-surgical slave robot equipped with intraocular dexterity devices. A uni...