Sciweavers

113 search results - page 12 / 23
» Improved Approximation for the Directed Spanner Problem
Sort
View
DISOPT
2008
107views more  DISOPT 2008»
14 years 11 months ago
The k-path tree matroid and its applications to survivable network design
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...
Esther M. Arkin, Refael Hassin
ICDCN
2009
Springer
15 years 4 months ago
Optimizing Multi-hop Queries in ZigBee Based Multi-sink Sensor Networks
Wireless sensor networks with multiple users collecting data directly from the sensors have many potential applications. An important problem is to allocate for each user a query r...
Bing Han, Gwendal Simon
CDC
2009
IEEE
156views Control Systems» more  CDC 2009»
15 years 3 months ago
Input design using Markov chains for system identification
This paper studies the input design problem for system identification where time domain constraints have to be considered. A finite Markov chain is used to model the input of the s...
Chiara Brighenti, Bo Wahlberg, Cristian R. Rojas
AI
2010
Springer
14 years 11 months ago
Updating action domain descriptions
How can an intelligent agent update her knowledge base about an action domain, relative to some conditions (possibly obtained from earlier observations)? We study this question in...
Thomas Eiter, Esra Erdem, Michael Fink, Ján...
ICASSP
2011
IEEE
14 years 3 months ago
Power allocation optimization in OFDM-based cognitive radios based on sensing information
Owing to the non-zero probability of the missed detection and false alarm of active primary transmission, a certain degree of performance degradation of the primary user (PU) from...
Xiaoge Huang, Baltasar Beferull-Lozano