663 search results - page 116 / 133 » Algorithms for Computing Minimal Unsatisfiable Subsets of Co... |
GIS
2007
ACM
14 years 8 months ago
2007
ACM
Given a transportation network, a vulnerable population, and a set of destinations, evacuation route planning identifies routes to minimize the time to evacuate the vulnerable pop...
WWW
2007
ACM
14 years 8 months ago
2007
ACM
Given a set of machines and a set of Web applications with dynamically changing demands, an online application placement controller decides how many instances to run for each appl...
Publication
We consider the colorization problem of grayscale images when some pixels, called scribbles, with initial colors are given. In this paper, we propose a new multi-layer graph model ...
VLDB
2002
ACM
13 years 7 months ago
2002
ACM
With the rapid growth of XML-document traffic on the Internet, scalable content-based dissemination of XML documents to a large, dynamic group of consumers has become an important...
CDC
2009
IEEE
13 years 8 months ago
2009
IEEE
We consider the problem of selecting a subset of p out of n sensors for the purpose of event detection, in a wireless sensor network (WSN). Occurrence or not of the event of intere...