Sciweavers

376 search results - page 46 / 76
» On the Advice Complexity of Online Problems
Sort
View
ICML
2007
IEEE
16 years 7 months ago
On learning linear ranking functions for beam search
Beam search is used to maintain tractability in large search spaces at the expense of completeness and optimality. We study supervised learning of linear ranking functions for con...
Yuehua Xu, Alan Fern
TCS
2008
15 years 6 months ago
Bincoloring
We introduce a new problem that was motivated by a (more complicated) problem arising in a robotized assembly environment. The bin coloring problem is to pack unit size colored it...
Sven Oliver Krumke, Willem de Paepe, Jörg Ram...
CORR
2011
Springer
210views Education» more  CORR 2011»
14 years 10 months ago
Transmission with Energy Harvesting Nodes in Fading Wireless Channels: Optimal Policies
Wireless systems comprised of rechargeable nodes have a significantly prolonged lifetime and are sustainable. A distinct characteristic of these systems is the fact that the node...
Omur Ozel, Kaya Tutuncuoglu, Jing Yang, Sennur Ulu...
IPPS
2009
IEEE
16 years 25 days ago
Competitive buffer management with packet dependencies
We introduce the problem of managing a FIFO buffer of bounded space, where arriving packets have dependencies among them. Our model is motivated by the scenario where large data f...
Alexander Kesselman, Boaz Patt-Shamir, Gabriel Sca...
DATE
2008
IEEE
134views Hardware» more  DATE 2008»
16 years 19 days ago
Adaptive Filesystem Compression for Embedded Systems
Abstract—Embedded system secondary storage size is often constrained, yet storage demands are growing as a result of increasing application complexity and storage of personal dat...
Lan S. Bai, Haris Lekatsas, Robert P. Dick