1707 search results - page 62 / 342 » Early Integer Programming |
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...
107
click to vote
IIE
2008
14 years 9 months ago
2008
Abstract. Extreme Programming (XP) shows several interesting approaches which are very attractive for education. It is centered around early and incremental creation of working sof...
SASO
2008
IEEE
15 years 4 months ago
2008
IEEE
—When programming a spatial computing medium such as a cellular automaton, the hop count distance to some set of sources (particles) is an often used information. In particular, ...
CADE
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We present KeY-C, a tool for deductive verification of C programs. KeY-C allows to prove partial correctness of C programs relative to pre- and postconditions. It is base...
ICGA
2007
14 years 9 months ago
2007
In this paper it will be explained how to use bitboards for move generation in shogi. In chess, bitboards have been used in most strong programs because of the easy representation...