830 search results - page 77 / 166 » Generalizing Global Constraints Based on Network Flows |
CCE
2005
13 years 8 months ago
2005
In this paper, a rigorous MILP formulation for grass-root design of heat exchanger networks is developed. The methodology does not rely on traditional supertargeting followed by n...
CONSTRAINTS
1998
13 years 8 months ago
1998
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...
MOBIDE
2006
ACM
14 years 2 months ago
2006
ACM
An important problem in mobile ad-hoc wireless sensor networks is the localization of individual nodes, i.e., each node’s awareness of its position relative to the network. In t...
TSP
2010
13 years 3 months ago
2010
Abstract--This work studies the near-optimality versus the complexity of distributed configuration management for wireless networks. We first develop a global probabilistic graphic...
AAAI
2010
13 years 10 months ago
2010
Security games, and important class of Stackelberg games, are used in deployed decision-support tools in use by LAX police and the Federal Air Marshals Service. The algorithms use...