169 search results - page 24 / 34 » Counting paths in digraphs |
CPAIOR
2010
Springer
14 years 1 months ago
2010
Springer
We present a new method to compute upper bounds of the number of solutions of binary integer programming (BIP) problems. Given a BIP, we create a dynamic programming (DP) table for...
CEC
2007
IEEE
14 years 17 days ago
2007
IEEE
In this paper, we present an ant system algorithm variant designed to solve the job shop scheduling problem. The proposed approach is based on a recent biological study which showe...
ICONIP
2007
13 years 10 months ago
2007
To date, the neural decoding of time-evolving physical state – for example, the path of a foraging rat or arm movements – has been largely carried out using linear trajectory m...
DMTCS
2010
13 years 6 months ago
2010
Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulation...
TROB
2011
13 years 3 months ago
2011
— This paper defines and analyzes a simple robot with local sensors that moves in an unknown polygonal environment. The robot can execute wall-following motions and can traverse...