592 search results - page 9 / 119 » Using Constraint Programming to Solve the Maximum Clique Pro... |
SIAMJO
2010
14 years 4 months ago
2010
The sensor network localization, SNL , problem in embedding dimension r, consists of locating the positions of wireless sensors, given only the distances between sensors that are ...
ECCV
1998
Springer
15 years 11 months ago
1998
Springer
?It is well-known that the problem of matching two relational structures can be posed as an equivalent problem of finding a maximal clique in a (derived) ?association graph.? Howev...
157
click to vote
CP
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We address a location-allocation problem that requires deciding the location of a set of facilities, the allocation of customers to those facilities under facility capaci...
ICLP
1997
Springer
15 years 1 months ago
1997
Springer
This paper presents a set of techniques that makes constraint programming a technique of choice for solving small (up to 30 nodes) traveling salesman problems. These techniques in...
GLOBECOM
2007
IEEE
15 years 3 months ago
2007
IEEE
— The maximum lifetime routing problem in wireless sensor networks has received increasing attention in recent years. One way is to formulate it as a linear programming problem b...