396 search results - page 50 / 80 » Exact Algorithms for Graph Homomorphisms |
157
Voted
WEA
2007
Springer
15 years 11 months 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 ...
162
click to vote
KR
2004
Springer
15 years 10 months ago
2004
Springer
One of the major advances in classical planning has been the development of Graphplan. Graphplan builds a layered structure called the planning graph, and then searches this struc...
145
click to vote
SIGCOMM
2006
ACM
15 years 10 months ago
2006
ACM
Researchers have proposed a variety of metrics to measure important graph properties, for instance, in social, biological, and computer networks. Values for a particular graph met...
173
click to vote
COMPGEOM
2004
ACM
15 years 10 months ago
2004
ACM
A frequently arising problem in computational geometry is when a physical structure, such as an ad-hoc wireless sensor network or a protein backbone, can measure local information...
180
click to vote
WADS
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Portions of such codes when t...