2911 search results - page 176 / 583 » A Logic of Graph Constraints |
96
Voted
CORR
2011
Springer
14 years 4 months ago
2011
Springer
Searching for optimal ways in a network is an important task in multiple application areas such as social networks, co-citation graphs or road networks. In the majority of applicat...
114
click to vote
AAAI
2006
15 years 2 months ago
2006
Several methods for breaking value symmetries have been proposed recently in the constraint programming community. They can be used in conjunction with variable symmetry breaking ...
122
Voted
MOR
2010
14 years 11 months ago
2010
We extend the work of Letchford (2000) by introducing a new class of valid inequalities for the traveling salesman problem, called the generalized domino-parity (GDP) constraints....
106
click to vote
INFOCOM
2009
IEEE
15 years 7 months ago
2009
IEEE
: Given a logical topology and a physical topology , the survivable logical topology design problem in an IP-overWDM optical network is to map the logical links into lightpaths in ...
106
Voted
ICTAC
2005
Springer
15 years 6 months ago
2005
Springer
In distributed and mobile systems with volatile bandwidth and fragile connectivity, non-functional aspects like performance and reliability become more and more important. To forma...