6740 search results - page 976 / 1348 » An s -Hamiltonian Line Graph Problem |
196
click to vote
WADS
2007
Springer
16 years 29 days ago
2007
Springer
In this paper we explore, from an algorithmic point of view, the extent to which the facial angles and combinatorial structure of a convex polyhedron determine the polyhedron—in ...
194
click to vote
WEA
2007
Springer
16 years 29 days ago
2007
Springer
For trunk packing problems only few approximation schemes are known, mostly designed for the European standard DIN 70020 [6] with equally sized boxes [8, 9, 11, 12]. In this paper ...
211
click to vote
3DPVT
2006
IEEE
16 years 28 days ago
2006
IEEE
Using Epipolar Image Analysis in the context of the correspondence finding problem in depth reconstruction has several advantages. One is the elegant incorporation of prior knowl...
161
click to vote
ISMVL
2006
IEEE
16 years 26 days ago
2006
IEEE
We define the MaxSAT problem for many-valued CNF formulas, called many-valued MaxSAT, and establish its complexity class. We then describe a basic branch and bound algorithm for ...
132
click to vote
CIG
2005
IEEE
16 years 14 days ago
2005
IEEE
AbstractWe describe Utile Coordination, an algorithm that allows a multiagent system to learn where and how to coordinate. The method starts with uncoordinated learners and maintai...