62 search results - page 9 / 13 » Exact Covers via Determinants |
ADBIS
2004
Springer
14 years 28 days ago
2004
Springer
Many geographical applications deal with spatial objects that cannot be adequately described by determinate, crisp concepts because of their intrinsically indeterminate and vague n...
HM
2009
Springer
14 years 4 days ago
2009
Springer
Abstract. In this work we extend a VNS for the periodic vehicle routing problem with time windows (PVRPTW) to a multiple VNS (mVNS) where several VNS instances are applied cooperat...
IJRR
2002
13 years 7 months ago
2002
The goal of coverage path planning is to determine a path that passes a detector over all points in an environment. This work prescribes a provably complete coverage path planner ...
JCT
2006
13 years 7 months ago
2006
Let Ng(f ) denote the number of rooted maps of genus g having f edges. An exact formula for Ng(f ) is known for g = 0 (Tutte, 1963), g = 1 (Arques, 1987), g = 2,3 (Bender and Canf...
SIGECOM
2003
ACM
14 years 24 days ago
2003
ACM
Preference elicitation — the process of asking queries to determine parties’ preferences — is a key part of many problems in electronic commerce. For example, a shopping age...