Sciweavers

465 search results - page 51 / 93
» On the Hardness of Range Assignment Problems
Sort
View
DIALM
2005
ACM
130views Algorithms» more  DIALM 2005»
15 years 1 months ago
On lower bounds for MAC layer contention in CSMA/CA-based wireless networks
Wireless LANs operating within unlicensed frequency bands require random access schemes such as CSMA/CA, so that wireless networks from different administrative domains (for exam...
Frank A. Zdarsky, Ivan Martinovic, Jens B. Schmitt
TACAS
2010
Springer
255views Algorithms» more  TACAS 2010»
14 years 9 months ago
Satisfiability Modulo the Theory of Costs: Foundations and Applications
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
Alessandro Cimatti, Anders Franzén, Alberto...
ECAI
2006
Springer
15 years 3 months ago
A Learning Classifier Approach to Tomography
Tomography is an important technique for noninvasive imaging: images of the interior of an object are computed from several scanned projections of the object, covering a range of a...
Kees Joost Batenburg
MSN
2007
Springer
160views Sensor Networks» more  MSN 2007»
15 years 6 months ago
Access Scheduling on the Control Channels in TDMA Wireless Mesh Networks
The access scheduling on the control channels in TDMA wireless mesh networks is studied in this paper. The problem is to assign time-slots for each node in the network to access th...
Hongju Cheng, Xiaohua Jia, Hai Liu
EMO
2006
Springer
219views Optimization» more  EMO 2006»
15 years 3 months ago
ParadisEO-MOEO: A Framework for Evolutionary Multi-objective Optimization
Abstract. This paper presents ParadisEO-MOEO, a white-box objectoriented generic framework dedicated to the flexible design of evolutionary multi-objective algorithms. This paradig...
Arnaud Liefooghe, Matthieu Basseur, Laetitia Jourd...