Sciweavers

703 search results - page 105 / 141
» Maintenance scheduling problems as benchmarks for constraint...
Sort
View
SENSYS
2003
ACM
14 years 4 months ago
Integrated coverage and connectivity configuration in wireless sensor networks
An effective approach for energy conservation in wireless sensor networks is scheduling sleep intervals for extraneous nodes, while the remaining nodes stay active to provide cont...
Xiaorui Wang, Guoliang Xing, Yuanfang Zhang, Cheny...
JAIR
2000
94views more  JAIR 2000»
13 years 10 months ago
Planning Graph as a (Dynamic) CSP: Exploiting EBL, DDB and other CSP Search Techniques in Graphplan
This paper reviews the connections between Graphplan's planning-graph and the dynamic constraint satisfaction problem and motivates the need for adapting CSP search technique...
Subbarao Kambhampati
MOBIHOC
2006
ACM
14 years 10 months ago
Proportionally fair allocation of end-to-end bandwidth in STDMA wireless networks
We consider the problem of designing distributed mechanisms for joint congestion control and resource allocation in spatial-reuse TDMA wireless networks. The design problem is pos...
Pablo Soldati, Björn Johansson, Mikael Johans...
IANDC
2007
107views more  IANDC 2007»
13 years 10 months ago
Task automata: Schedulability, decidability and undecidability
We present a model, task automata, for real time systems with non-uniformly recurring computation tasks. It is an extended version of timed automata with asynchronous processes th...
Elena Fersman, Pavel Krcál, Paul Pettersson...
ICANN
2007
Springer
14 years 5 months ago
Input Selection for Radial Basis Function Networks by Constrained Optimization
Input selection in the nonlinear function approximation is important and difficult problem. Neural networks provide good generalization in many cases, but their interpretability is...
Jarkko Tikka