Sciweavers

230 search results - page 31 / 46
» Constraint Satisfaction with Delayed Evaluation
Sort
View
AAAI
2006
13 years 11 months ago
The Impact of Balancing on Problem Hardness in a Highly Structured Domain
Random problem distributions have played a key role in the study and design of algorithms for constraint satisfaction and Boolean satisfiability, as well as in our understanding o...
Carlos Ansótegui, Ramón Béjar...
TIT
2008
73views more  TIT 2008»
13 years 9 months ago
Detection of Information Flows
Abstract-- Distributed detection of information flows by timing analysis is considered. Timing measurements are subject to perturbations and the insertion of chaff noise. Moreover,...
Ting He, Lang Tong
ESA
2006
Springer
140views Algorithms» more  ESA 2006»
14 years 1 months ago
Latency Constrained Aggregation in Sensor Networks
A sensor network consists of sensing devices which may exchange data through wireless communication. A particular feature of sensor networks is that they are highly energy constrai...
Luca Becchetti, Peter Korteweg, Alberto Marchetti-...
CIAC
2003
Springer
98views Algorithms» more  CIAC 2003»
14 years 2 months ago
Improving Customer Proximity to Railway Stations
Abstract. We consider problems of (new) station placement along (existing) railway tracks, so as to increase the number of users. We prove that, in spite of the NP-hardness for the...
Evangelos Kranakis, Paolo Penna, Konrad Schlude, D...
GLOBECOM
2010
IEEE
13 years 7 months ago
A Distributed Wake-Up Scheduling for Opportunistic Forwarding in Wireless Sensor Networks
In wireless sensor networks (WSNs), sensor nodes are typically subjected to energy constraints and often prone to topology changes. While duty cycling has been widely used for ener...
Chul-Ho Lee, Do Young Eun