Sciweavers

223 search results - page 37 / 45
» Proving Termination by Bounded Increase
Sort
View
71
Voted
JAL
2008
74views more  JAL 2008»
14 years 9 months ago
Solving satisfiability in the tile assembly model with a constant-size tileset
Biological systems are far more complex and robust than systems we can engineer today. One way to increase the complexity and robustness of our engineered systems is to study how ...
Yuriy Brun
67
Voted
IANDC
2007
66views more  IANDC 2007»
14 years 9 months ago
Quantitative temporal logics over the reals: PSpace and below
In many cases, the addition of metric operators to qualitative temporal logics (TLs) increases the complexity of satisfiability by at least one exponential: while common qualitat...
Carsten Lutz, Dirk Walther, Frank Wolter
INFOCOM
2010
IEEE
14 years 8 months ago
Distributed Monitoring and Aggregation in Wireless Sensor Networks
— Self-monitoring the sensor statuses such as liveness, node density and residue energy is critical for maintaining the normal operation of the sensor network. When building the ...
Changlei Liu, Guohong Cao
AAIM
2009
Springer
143views Algorithms» more  AAIM 2009»
14 years 7 months ago
Discrete online TSP
In this paper we introduce a discrete version of the online traveling salesman problem (DOLTSP). We represent the metric space using a weighted graph, where the server is allowed t...
Mauro Aprea, Esteban Feuerstein, Gustavo Sadovoy, ...
MASS
2010
159views Communications» more  MASS 2010»
14 years 4 months ago
Efficient WiFi deployment algorithms based on realistic mobility characteristics
Abstract--Recent years have witnessed the emergence of numerous new Internet services for mobile users. Supporting mobile applications via public WiFi networks has received signifi...
Tian Wang, Guoliang Xing, Minming Li, Weijia Jia