Sciweavers

409 search results - page 72 / 82
» Matching Scenarios with Timing Constraints
Sort
View
SODA
2010
ACM
185views Algorithms» more  SODA 2010»
13 years 7 months ago
Solving MAX-r-SAT Above a Tight Lower Bound
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Sze...
GIS
2007
ACM
14 years 10 months ago
Evacuation route planning: scalable heuristics
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...
Sangho Kim, Betsy George, Shashi Shekhar
ACMDIS
2004
ACM
14 years 2 months ago
Context photography
Context photography consists of capturing context when taking a still picture, by sensing physical input in addition to light and representing it visually in real time. With this ...
Lalya Gaye, Lars Erik Holmquist, Maria Håkan...
JSAC
2007
132views more  JSAC 2007»
13 years 8 months ago
Lifetime maximization via cooperative nodes and relay deployment in wireless networks
— Extending lifetime of battery-operated devices is a key design issue that allows uninterrupted information exchange among distributed nodes in wireless networks. Cooperative co...
Thanongsak Himsoon, W. Pam Siriwongpairat, Zhu Han...
TMC
2011
261views more  TMC 2011»
13 years 3 months ago
Breath: An Adaptive Protocol for Industrial Control Applications Using Wireless Sensor Networks
—An energy-efficient, reliable and timely data transmission is essential for wireless sensor networks (WSNs) employed in scenarios where plant information must be available for ...
Pan Gun Park, Carlo Fischione, Alvise Bonivento, K...